000			01283nam a22002417a 4500
003			OSt
005			20240108150234.0
008			240108b |||||||| |||| 00| 0 eng d
020			_a9781461273097
040			_cCUS
082			_221 _a511.3 _bKOZ/A
100			_a Kozen,Dexter C. _eEditor. _924768
245			_aAutomata and Computability, Undergraduate Texts in Computer Science.
260			_aNew York: _bSpringer, _c1997.
300			_axiii,400p.
505			_aLecture 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
650			_x Computable functions _924769
650			_xFonctions calculables _924770
650			_xMachine theory Théorie des automates _924771
700			_aGries,David _924772
700			_aSchneider,Fred B. _924773
942			_2ddc _cWB16
999			_c214345 _d214345