TY  - BOOK
AU  - Sudkamp,Thomas A.
TI  - Languages and machines: an introduction to the theory of computer science 
SN  - 0201821362
U1  - 511.3 
PY  - 1997///
CY  - Reading, Mass.
PB  - Addison-Wesley Pub
KW  - Computational complexity
KW  - Formal languages
KW  - Machine theory
N1  - Part I Foundations: 1. Mathematical preliminaries. 2. Languages. - Part II Context-free grammars and parsing: 3. Context-free grammars. 4. Parsing: an introduction. 5. Normal forms. - Part III Automata and languages: 6. Finite automata. 7. Regular languages and sets. 8. Pushdown automata and context-free languages. 9. Turing machines. 10. The Chomsky hierarchy. - Part IV Decidability and computability : 11. Decidability. 12. Numeric computation. 13. Mu-recursive functions. - Part V Computational complexity: 14. Computational complexity. 15. Tractability and NP-complete problems. - Part VI Deterministic parsing: 16. LL(k) Grammars. 17. LR(k) Grammars
ER  -