Kozen,Dexter C.
Automata and Computability, Undergraduate Texts in Computer Science.
- New York: Springer, 1997.
- xiii,400p.
Lecture 32
Decidable and Undecidable ProblemsLecture 33
Reduction; Lecture
34 Rice's Theorem; Lecture
35 Undecidable Problems About CFLs; Lecture
36 Other Formalisms; Lecture
37 The λ-Calculus; Supplementary Lecture I While Programs; Supplementary Lecture J Beyond Undecidability; Lecture
38 Godel's Incompleteness Theorem; Lecture
39 Proof of the Incompleteness Theorem; Supplementary Lecture K Godel's Proof; Exercises; Miscellaneous Exercises Finite Automata and Regular Sets; Miscellaneous Exercises Pushdown Automata and Context-Free Languages
9781461273097
-- Computable functions --Fonctions calculables --Machine theory Théorie des automates
511.3 / KOZ/A