000			02757 a2200397 4500
001			58396
650			_91359 _aComputational complexity
999			_c58396 _d14924
003			TR-AnTOB
005			20200526145240.0
008			070115s2006 maua b 001 0 eng
010			_a2004030342
019			_a26477674
020			_a0321322215 (alk. paper)
020			_a0321315340 (International ed.)
040			_aDLC _beng _cDLC _dDLC _dOrLoB-B
041			_aeng
050			_aQA267.3 _b.S83 2006
090			_aQA267.3 .S83 2006
100			_aSudkamp, Thomas A. _930996
245		0	_aLanguages and machines : _ban introduction to the theory of computer science / _cThomas A. Sudkamp.
246		3	_aIntroduction to the theory of computer science : _blanguages and machines.
250			_a3rd ed.
264		1	_aBoston : _bPearson Addison-Wesley, _cc2006.
300			_axvii, 654 p. : _bill. ; _c24 cm.
504			_aIncludes bibliographical references (p. 641-647) and index.
505		0	_aCh. 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.
520			_a"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.
650			_aHesaplama karmaşıklığı _921495
650			_aFormal languages _94379
650			_aBiçimsel diller _913631
650			_aMachine theory _91804
650			_aMakine teorisi _91805
901			_a0018168
902			_aGT
942			_cBK