000			01737cam a2200325 a 4500
999			_c11069 _d11069
001			13821912
003			PK-SiUMT
005			20220217122255.0
008			041221s2006 maua b 001 0 eng
010			_a 2004030342
020			_a9788131714751
020			_a0321322215 (alk. paper)
040			_aDLC _cDLC _dDLC
050	0	0	_aQA267.3 _b.S83 2006
082	0	0	_a511.3 _222 _bSUD-T 2006 12475
100	1		_aSudkamp, Thomas A. _93963
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 pages. : _billustrations. ; _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. _93964
650		0	_aMachine theory. _93965
650		0	_aComputational complexity. _93966
856	4	1	_3Table of contents _uhttp://www.loc.gov/catdir/toc/ecip055/2004030342.html
906			_a7 _bcbc _corignew _d1 _eecip _f20 _gy-gencatlg
942			_2ddc _cBK