Languages and machines
Subtitle: an introduction to the theory of computer science
By: Thomas A. Sudkamp.
Edition: 3rd ed.
Publisher: Pearson Addison-Wesley
Published: 2006
Place of publication: Boston
Language: eng
Number of pages: 654
Subjects: Formal languages.; Machine theory.; Computational complexity.
Notes: Includes bibliographical references (p. 641-647) and index.
Table of contents: title: Mathematical preliminaries; title: Languages; title: Context-free grammars; title: Normal forms for context-free grammars; title: Finite automata; title: Properties of regular languages; title: Pushdown automata and context-free languages; title: Turing machines; title: Turing computable functions; title: The Chomsky hierarchy; title: Decision problems and the church-turing thesis; title: Undecidability; title: Mu-recursive functions; title: Time complexity; title: P, NP and Cook's theorem; title: NP-complete problems; title: Additional complexity classes; title: Parsing : an introduction; title: LL(k) grammars; title: LR(k) grammars.