Automata and Computability, Undergraduate Texts in Computer Science.
Material type:![Text](/opac-tmpl/lib/famfamfam/BK.png)
Item type | Current library | Call number | Status | Date due | Barcode | Item holds |
---|---|---|---|---|---|---|
![]() |
Central Library, Sikkim University General Book Section | 511.3 KOZ/A (Browse shelf(Opens below)) | Available | 053277 |
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
There are no comments on this title.