Normal view MARC view ISBD view

Automata and Computability, Undergraduate Texts in Computer Science.

By: Kozen,Dexter C [Editor.]Contributor(s): Gries,David | Schneider,Fred B Material type: Text

TextPublication details: New York: Springer, 1997Description: xiii,400pISBN: 9781461273097Subject(s): -- Computable functions | -- Fonctions calculables | -- Machine theory Théorie des automatesDDC classification: 511.3

Contents:

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

Tags from this library: No tags from this library for this title. Log in to add tags.

Average rating: 0.0 (0 votes)

Holdings ( 1 )
Title notes ( 1 )
Comments ( 0 )

Holdings
Item type	Current library	Call number	Status	Date due	Barcode	Item holds
General Books	Central Library, Sikkim University General Book Section	511.3 KOZ/A (Browse shelf(Opens below))	Available		053277

Total holds: 0

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.

to post a comment.