TY  - BOOK
AU  -  Kozen,Dexter C.
AU  - Gries,David 
AU  - Schneider,Fred B. 
TI  - Automata and Computability, Undergraduate Texts in Computer Science
SN  - 9781461273097
U1  - 511.3 21
PY  - 1997///
CY  - New York: 
PB  - Springer
KW  -  Computable functions
KW  - Fonctions calculables
KW  - Machine theory Théorie des automates
N1  - 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
ER  -