000			01463nam a2200277 a 4500
001			vtls000001419
003			VRT
005			20250102223850.0
008			081102s2006 maua |b 001 0 eng d
020			_a9780619217648
020			_a0619217642
039		9	_a201402040051 _bVLOAD _c201009200922 _dmalmash _c200811020757 _dNoora _y200811020757 _zNoora
050		4	_aQA267 _b.S56 2006
100	1		_aSipser, Michael. _931526
245	1	0	_aIntroduction to the theory of computation / _cMichael Sipser.
250			_a2nd ed., international ed.
260			_aBoston : _bThomson Course Technology, _cc2006.
300			_axvii, 437 p. : _bill. ; _c25 cm.
500			_a"The content of this text differs from the US version" -- back cover.
504			_aIncludes bibliographical references and index.
505			_aIntroduction. Part 1: Automata and Languages. 1. Regular Languages. 2. Context-Free Languages. Part 2: Computability Theory. 3. The Church-Turing Thesis. 4. Decidability. 5. Reducibility. 6. Advanced Topics in Computability Theory. Part 3: Complexity Theory. 7. Time Complexity. 8. Space Complexity. 9. Intractability. 10. Advanced Topics in Complexity Theory. Selected Bibliography.
520			_aThis market leading text on computational theory provides a mathematical treatment of computer science theory designed around theorems and proofs.
650		0	_aMachine theory. _91100
650		0	_aComputational complexity. _91102
942			_2lcc _n0 _cBK
999			_c13556 _d13556