000			01580pam a2200337 a 4500
005			20150712005508.0
008			041221s2006 maua b 001 0 eng
010			_a 2004030342
020			_a0321322215
040			_aDLC _beng _cDLC _dDLC
050	0	0	_aQA267.3 _b.S83 2006
060			_bSL
082	0	0	_a511.3 _222
084			_a511.3 _bSL
100	1		_aSudkamp, Thomas A.
245	1	0	_aLanguages and machines _h[[Book] :] _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. ; _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.
521			_aAll Ages.
650		0	_aFormal languages.
650		0	_aMachine theory.
650		0	_aComputational complexity.
700	1		_aSudkamp, Thomas A.
856	4	1	_3Table of contents _uhttp://www.loc.gov/catdir/toc/ecip055/2004030342.html
001			0000047538
003			0000
942			_cBK
999			_c53190 _d53190