Image from Amazon.com
Image from Google Jackets
An introduction to the theory of computer science, languages and machines Thomas A Sudkamp
Material type:
TextLanguage: English Publication details: New Delhi : Pearson, 2008.Edition: 3rd edDescription: xvii, 654pISBN: - 9788131714751
- 004 SUD
Contents:
Foundations.. Mathematical Preliminaries.. Languages.. Grammars, Automata, and Languages.. Context-Free Grammars.. Normal Forms for Context-Free Grammars.. Finite Automata.. Properties of Regular Languages.. Pushdown Automata and Context-Free Languages.. Computability Turing Machines.. Turing Computable Functions.. The Chomsky Hierarchy.. Decision Problems and the Church-Turing Thesis Undecidability.. Mu-Recursive Functions.. Computational Complexity.. Time Complexity.. P, NP, and Cook's Theorem.. NP-Complete Problems.. Additional Complexity Classes.. Deterministic Parsing.. Parsing: An Introduction.. LL(k) Grammars.. LR(k) Grammars
| Item type | Current library | Call number | Status | Date due | Barcode | Item holds |
|---|---|---|---|---|---|---|
Books
|
Learning Resource Centre | 004 SUD (Browse shelf(Opens below)) | Available | 1700 |
Total holds: 0
Foundations.. Mathematical Preliminaries.. Languages.. Grammars, Automata, and Languages.. Context-Free Grammars.. Normal Forms for Context-Free Grammars.. Finite Automata.. Properties of Regular Languages.. Pushdown Automata and Context-Free Languages.. Computability Turing Machines.. Turing Computable Functions.. The Chomsky Hierarchy.. Decision Problems and the Church-Turing Thesis Undecidability.. Mu-Recursive Functions.. Computational Complexity.. Time Complexity.. P, NP, and Cook's Theorem.. NP-Complete Problems.. Additional Complexity Classes.. Deterministic Parsing.. Parsing: An Introduction.. LL(k) Grammars.. LR(k) Grammars
There are no comments on this title.