000			01933nam a2200397 i 4500
999			_c906 _d906
001			17275170
003			OSt
005			20220323081452.0
008			120427s2013 maua 001 0 eng d
010			_a 2012938665
020			_a9781133187790 _qhardcover
040			_aDLC _beng _cDLC _dEG-CaTKH _erda
042			_apcc
050			_aQA267 _b .S56 2013
082	0	0	_a511.35 SI.I 2013 _223
100	1		_aSipser, Michael, _eauthor.
245	1	0	_aIntroduction to the theory of computation / _cMichael Sipser.
250			_aThird edition.
264		1	_aBoston, MA : _bCengage Learning, _c2013.
300			_axxii, 458 pages : _billustrations ; _c25 cm.
336			_atext _btxt _2rdacontent
337			_aunmediated _bn _2rdamedia
338			_avolume _bnc _2rdacarrier
504			_aIncludes bibliographical references (pages 443-447) and index.
505	0		_aPart 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.
520			_aGain a solid understanding of the fundamental mathematical properties of computer hardware, software, and applications with a blend of practical and philosophical coverage and mathematical treatments, including advanced theorems and proofs. This books comprehensive coverage makes it a valuable reference for studies in theoretical computing.
650		0	_aMachine theory.
650		0	_aComputational complexity.
942			_2ddc _cBK
998			_ahuda.mahmoud _bM _d20220322
998			_amona.romia _bR _d20220323
260			_aBoston, MA : _bCourse Technology Cengage Learning, _c2012.
263			_a1207
906			_a0 _bibc _corignew _d2 _eepcn _f20 _gy-gencatlg