000			01508nam a2200253 4500
001			vtls001427160
003			MY-SjTCS
005			20200226121038.0
008			110218 1997 00 eng
020			_a0201821362
039		9	_a201909271555 _bdianafitri _c201102181311 _dVLOAD _y200407271856 _zVLOAD
082	0	4	_a511.3 _bSUD
100	1		_aSudkamp, Thomas A. _98068
245	1	0	_aLanguages and machines : _ban introduction to the theory of computer science / _cThomas A. Sudkamp
250			_a2nd ed.
260			_aReading, Mass. : _bAddison-Wesley Pub, _cc1997.
300			_axv, 569 p. : _bill. ; _c24 cm.
505	0		_aPart 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.
650		0	_aComputational complexity. _97496
650		0	_aFormal languages. _96745
650		0	_aMachine theory. _91645
920			_aUOSC : 560178, 560544, 560545
921			_aCIT (RMIT) : 546443, 546444, 546445
999			_c175492 _d175492