000			01440nam a2200277 a 4500
001			13821912
008			100928m20092006maua b 001 0 eng d
010			_a 2004030342
020			_a9788131714751
020			_a0321322215 (alk. paper)
040			_aDLC _cDLC _dDLC _dDB-DhAAL
082	0	0	_a511.3 _222
100	1		_aSudkamp, Thomas A.
245	1	0	_aLanguages and machines : _ban introduction to the theory of computer science / _cThomas A. Sudkamp.
250			_a3rd ed.
260			_aBoston ; _aIndia : _bPearson Addison-Wesley, _cc2006.[Impression 2009]
300			_axvii, 654 p. : _bill. ; _c24 cm.
504			_aIncludes bibliographical references (p. 641-647) and index.
505	0		_aMathematical preliminaries -- Languages -- Context-free grammars -- Normal forms for context-free grammars -- Finite automata -- Properties of regular languages -- Pushdown automata and context-free languages -- Turing machines -- Turing computable functions -- The Chomsky hierarchy -- Decision problems and the church-turing thesis -- Undecidability -- Mu-recursive functions -- Time complexity -- P, NP and Cook's theorem -- NP-complete problems -- Additional complexity classes -- Parsing : an introduction -- LL(k) grammars -- LR(k) grammars.
650		0	_aFormal languages.
650		0	_aMachine theory.
650		0	_aComputational complexity.
942	0	0	_02
999			_c9569 _d9569