000			01431pam a2200277 a 4500
999			_c79529 _d316806
001			57344192
003			OCoLC
005			20210307102841.0
008			041221s2006 maua b 001 0 eng
010			_a2004030342
020			_a0321322215 (alk. paper)
040			_aDLC _cDLC _dYDX _dMUQ
050	0	0	_aQA267.3 _b.S83 2006
082	0	0	_a511.3 _222 _bSTL
100	1		_aSudkamp, Thomas A _988736
245	1	0	_aLanguages and machines : _ban introduction to the theory of computer science / _cThomas A. Sudkamp
250			_a3rd ed
260			_aBoston : _bPearson/Addison-Wesley, _cc2006
300			_axvii, 654 p. : _bill. ; _c25 cm
504			_aIncludes bibliographical references (p. 641-647) and indexes
505	0		_aIntroduction -- Mathematical 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 _988420
650		0	_aMachine theory _93543
650		0	_aComputational complexity _988737
942			_2ddc _cBOOK