000			01967cam a2200361 a 4500
005			20250914145453.0
008			060720s2006 maua b 001 0 eng
020			_a0321322215 (alk. paper) _cRM380.76
039		9	_a200607201236 _brahah _y07-20-2006 _zrahah
050	0	0	_aQA267.3 _b.S83 2006
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 : _bPearson Addison-Wesley, _cc2006.
300			_axvii, 654 p. : _bill. ; _c24 cm.
500			_aPS UNIKEB
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.
856	4	1	_3Table of contents _uhttp://www.loc.gov/catdir/toc/ecip055/2004030342.html
907			_a.b1377122x _b2019-11-13 _c2019-11-12
942			_n0
914			_avtls003331736
906			_a7 _bcbc _corignew _d1 _eecip _f20 _gy-gencatlg
991			_aJabatan Sains Komputer
998			_anone _b2006-07-07 _cm _da _feng _gmau _y0 _z.b1377122x
999			_c375328 _d375328