MARC details
| 000 -CABECERA |
|---|
| campo de control de longitud fija |
04758 a2200265 4500 |
| 008 - DATOS DE LONGITUD FIJA--INFORMACIÓN GENERAL |
|---|
| campo de control de longitud fija |
2006 |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER |
|---|
| International Standard Book Number |
9780619217648 |
| 040 ## - FUENTE DE CATALOGACIÓN |
|---|
| Centro catalogador/agencia de origen |
GAMADERO |
| Lengua de catalogación |
spa |
| Centro/agencia transcriptor |
GAMADERO |
| 041 ## - CÓDIGO DE IDIOMA |
|---|
| Código de lengua del texto/banda sonora o título independiente |
Español |
| 050 00 - SIGNATURA TOPOGRÁFICA DE LA BIBLIOTECA DEL CONGRESO |
|---|
| Número de clasificación |
QA267 |
| Cutter |
S56 |
| Año |
2006 |
| 100 ## - ENTRADA PRINCIPAL--NOMBRE DE PERSONA |
|---|
| Nombre de persona |
SIPSER MICHAEL |
| 245 ## - MENCIÓN DEL TÍTULO |
|---|
| Título |
INTRODUCTION TO THE THEORY OF COMPUTATION |
| 250 ## - MENCION DE EDICION |
|---|
| Mención de edición |
1ra. edición |
| 260 ## - PUBLICACIÓN, DISTRIBUCIÓN, ETC. |
|---|
| Nombre del editor, distribuidor, etc. |
CENGAGE LEARNING |
| Lugar de publicación, distribución, etc. |
United States of America |
| Fecha de publicación, distribución, etc. |
2006 |
| 300 ## - DESCRIPCIÓN FÍSICA |
|---|
| Extensión |
427 p |
| Otras características físicas |
Ilustración |
| Dimensiones |
17 x 24 cm |
| 505 ## - NOTA DE CONTENIDO CON FORMATO |
|---|
| Nota de contenido con formato |
Preface to the First Edition<br/>To the student .. .<br/>To the educator..<br/>The first edition..<br/>Feedback to the author<br/>Acknowledgments .<br/>Preface to the Second Edition (International)<br/>0 Introduction<br/>0.1 Automata, Computability, and Complexity<br/>Complexity theory Computability theory<br/>Automata theory • ..<br/>0.2 Mathematical Notions and Terminology<br/>Sets....・・・・・<br/>Sequences and tuples<br/>Functions and relations<br/>Graphs . ......<br/>Strings and languages<br/>Boolean logic. • •<br/>Summary of mathematical terms<br/>0.3 Definitions, Theorems, and Proofs<br/>Finding proofs<br/>Part One: Automata and Languages<br/>1 Regular Languages<br/>1.1<br/>Finite Automata<br/>Formal definition of a finite automaton<br/>Examples of finite automata<br/>Formal definition of computation<br/>Designing finite automata<br/>The regular operations<br/>1.2 Nondeterminism • • •<br/>Formal definition of a nondeterministic finite automaton . .<br/>Equivalence of NFAs and DFAs<br/>Closure under the regular operations . . . .<br/>1.3<br/>Regular Expressions •<br/>Formal definition of a regular expression<br/>Equivalence with finite automata<br/>1.4 Nonregular Languages.<br/>The pumping lemma for regular languages<br/>Exercises, Problems, and Solutions<br/>2 Context-Free Languages<br/>2.1 Context-free Grammars<br/>Formal definition of a context-free grammar<br/>Examples of context-free grammars<br/>Designing context-free grammars<br/>Ambiguity<br/>Chomsky normal form<br/>2.2 Pushdown Automata . .<br/>Formal definition of a pushdown automaton.<br/>Examples of pushdown automata<br/>Equivalence with context-free grammars.<br/>2.3 Non-context-free Languages<br/>The pumping lemma for context-free languages . .<br/>Exercises, Problems, and Solutions<br/>Part Two: Computability Theory<br/>3 The Church-Turing Thesis<br/>3.1 Turing Machines<br/>Formal definition of a Turing machine .<br/>・・<br/>Examples of Turing machines<br/>3.2 Variants of Turing Machines .<br/>Multitape Turing machines<br/>Nondeterministic Turing machines .<br/>Enumerators<br/>Equivalence with other models<br/>3.3<br/>The Definition of Algorithm<br/>Hilbert's problems<br/>Terminology for describing Turing machines<br/>Exercises, Problems, and Solutions<br/>4 Decidability<br/>4.1 Decidable Languages.<br/>Decidable problems concerning regular languages<br/>4.2<br/>Decidable problems concerning context-free languages.<br/>The Halting Problem<br/>The diagonalization method<br/>The halting problem is undecidable A Turing-unrecognizable language<br/>Exercises, Problems, and Solutions<br/>5<br/>Reducibility<br/>5.1 Undecidable Problems from Language Theory<br/>Reductions via computation histories .<br/>.. •<br/>5.2<br/>5.3<br/>A Simple Undecidable Problem . ..<br/>Mapping Reducibility<br/>Computable functions<br/>Formal definition of mapping reducibility<br/>Exercises, Problems, and Solutions<br/>6 Advanced Topics in Computability Theory<br/>6.1<br/>The Recursion Theorem<br/>Self-reference<br/>....<br/>Terminology for the recursion theorem<br/>Applications<br/> |
| 520 ## - RESUMEN, ETC. |
|---|
| Resumen, etc. |
This highly anticipated revision of Michael Sipser's popular text builds upon the strengths of the previous edition. It tells the fascinating story of the theory of computation- a subject with beautiful results and exciting unsolved questions at the crossroads of mathematics and computer science. Sipser's candid, crystal-clear style allows students at every level to understand and enjoy this field. His innovative "proof idea" sections reveal the intuition underpinning the formal proofs of theorems by explaining profound concepts in plain English.<br/>The new edition incorporates many improvements students and professors have suggested over the years and offers completely updated, classroom tested problem sets with sample solutions at the end of each chapter.<br/>About the Author<br/>Michael Sipser has taught theoretical computer science and other mathematical subjects at the Massachusetts Institute of Technology for the past 25 years, where he is a Professor of Applied Mathematics and a member of the Computer Science ang rtificial Intelligence Laboratory (SAIL). Currently, he is the head<br/>He Man anatics Department. He enjoys teaching and pondering the many lysteries of complexity theory.<br/> |
| 526 ## - NOTA DE INFORMACIÓN SOBRE EL PROGRAMA DE ESTUDIO |
|---|
| Program name |
Ingeniería en Tecnologías de la Información y Comunicaciones |
| 650 #0 - PUNTO DE ACCESO ADICIONAL DE MATERIA--TÉRMINO DE MATERIA |
|---|
| Término de materia o nombre geográfico como elemento de entrada |
Computación |
| 9 (RLIN) |
3768 |
| 942 ## - ELEMENTOS DE ENTRADA SECUNDARIOS (KOHA) |
|---|
| Tipo de ítem Koha |
Libro |
| Fuente del sistema de clasificación o colocación |
Clasificación Decimal Dewey |
| Edición |
1ra. edición |
| 945 ## - CATALOGADORES |
|---|
| Número del Creador del Registro |
1 |
| Nombre del Creador del Registro |
admin |
| Número de último modificador del registro |
1270 |
| Nombre del último modificador del registro |
María Elena Olvera Picina |
