TY  - GEN
AU  - Sudkamp, Thomas A.
TI  - Languages and machines: an introduction to the theory of computer science 
SN  - 0321322215 (alk. paper)
AV  - QA267.3 .S83 2006
PY  - 2006///
CY  - Boston
PB  - Pearson Addison-Wesley
KW  - Computational complexity
KW  - Hesaplama karmaşıklığı
KW  - Formal languages
KW  - Biçimsel diller
KW  - Machine theory
KW  - Makine teorisi
N1  - Includes bibliographical references (p. 641-647) and index; Ch. 1. Mathematical preliminaries -- Ch. 2. Languages -- Ch. 3. Context-free grammars -- Ch. 4. Normal forms for context-free grammars -- Ch. 5. Finite automata -- Ch. 6. Properties of regular languages -- Ch. 7. Pushdown automata and context-free languages -- Ch. 8. Turing machines -- Ch. 9. Turing computable functions -- Ch. 10. The Chomsky hierarchy -- Ch. 11. Decision problems and the church-turing thesis -- Ch. 12. Undecidability -- Ch. 13. Mu-recursive functions -- Ch. 14. Time complexity -- Ch. 15. P, NP, and Cook's theorem -- Ch. 16. NP-complete problems -- Ch. 17. Additional complexity classes -- Ch. 18. Parsing : an introduction -- Ch. 19. LL(k) grammars -- Ch. 20. LR(k) grammars -- App. I. Index of notation -- App. II. The Greek alphabet -- App. III. The ASCII character set -- App. IV. Backus-Naur form definition of Java
N2  - "Languages and Machines introduces the foundations of computer science and examines the capabilities and limitations of algorithmic computation. With an expanded selection of topics, the Third Edition features a wealth of examples, illustrations, and practical applications alongside the presentation of the theoretical concepts." "This student-friendly, mathematically sound presentation assumes no advanced prerequisites. The flexible design of the text allows instructors to structure their course around formal language and automata theory, computability, computational complexity, or the use of formal languages in programming language definition and parsing."--BOOK JACKET
ER  -