Automata and Computability.

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autor principal: Kozen, Dexter C.
Otros Autores: Gries, David, Schneider, Fred B.
Formato: Electrónico eBook
Idioma:Inglés
Publicado: New York : Springer New York, 1997.
Edición:N.
Temas:
Machine theory.
Computable functions.
Théorie des automates.
Fonctions calculables.
Computable functions
Machine theory
Acceso en línea:Texto completo
Tabla de Contenidos:
  • UNDERGRADUATE TEXTS IN COMPUTER SCIENCE; Automata and Computability; Copyright; Preface; Contents; Lectures; Lecture 1 Course Roadmap and Historical Perspective; Lecture 2 Strings and Sets; Lecture 3 Finite Automata and Regular Sets; Lecture 4 More on Regular Sets; Lecture 5 Nondeterministic Finite Automata; Lecture 6 The Subset Construction; Lecture 7 Pattern Matching; Lecture 8 Pattern Matching and Regular Expressions; Lecture 9 Regular Expressions and Finite Automata; Supplementary Lecture A Kleene Algebra and Regular Expressions; Lecture 10 Homomorphisms.
  • Lecture 11 Limitations of Finite AutomataLecture 12 Using the Pumping Lemma; Lecture 13 DFA State Minimization; Lecture 14 A Minimization Algorithm; Lecture 15 Myhill-Nerode Relations; Lecture 16 The Myhill-Nerode Theorem; Supplementary Lecture B Collapsing Nondeterministic Automata; Supplementary Lecture C Automata on Terms; Supplementary Lecture D The Myhill-Nerode Theorem for Term Automata; Lecture 17 Two-Way Finite Automata; Lecture 18 2DFAs and Regular Sets; Lecture 19 Context-Free Grammars and Languages; Lecture 20 Balanced Parentheses; Lecture 21 Normal Forms.
  • Lecture 22 The Pumping Lemma for CFLsLecture 23 Pushdown Automata; Supplementary Lecture E Final State Versus Empty Stack; Lecture 24 PDAs and CFGs; Lecture 25 Simulating NPDAs by CFGs; Supplementary Lecture F Deterministic Pushdown Automata; Lecture 26 Parsing; Lecture 27 The Cocke-Kasami-Younger Algorithm; Supplementary Lecture G The Chomsky-Schützenberger Theorem; Supplementary Lecture H Parikh's Theorem; Lecture 28 Turing Machines and Effective Computability; Lecture 29 More on Turing Machines; Lecture 30 Equivalent Models; Lecture 31 Universal Machines and Diagonalization.
  • Miscellaneous Exercises Turing Machines and Effective ComputabilityHints for Selected Miscellaneous Exercises; Solutions to Selected Miscellaneous Exercises; References; Notation and Abbreviations; Index.

Ejemplares similares