000			03046cam a2200385 i 4500
001			14218587
005			20230615115008.0
008			060104s2013 maua b 001 0 eng d
010			_a 2006271030
020			_a9781133187813 _qpaperback
040			_aDLC _beng _cDLC _dDLC _dEG-CaTKH _erda
050	0	0	_aQA267 _b.S56 2006
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, international edition.
264		1	_aAustralia : _bCengage Learning, _c2013.
300			_axxii, 458 pages : _billustrations ; _c24 cm.
336			_atext _btxt _2rdacontent
337			_aunmediated _bn _2rdamedia
338			_avolume _bnc _2rdacarrier
504			_aIncludes bibliographical references (pages 443-447) and index.
505	0		_a 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. Interactibility -- 10. Advanced topics in complexity theory.
520			_aClearly present even the most complex computational theory topics to your students using Sipser's textbook. This updated edition continues Sipser's approachable style with timely revisions, additional exercises, and more memorable examples in key areas. $b Gain a clear understanding of even the most complex, highly theoretical computational theory topics in the approachable presentation found only in the market-leading INTRODUCTION TO THE THEORY OF COMPUTATION, 3E, International Edition. The number one choice for today's computational theory course, this revision continues the book's well-known, approachable style with timely revisions, additional practice, and more memorable examples in key areas. A new first-of-its-kind theoretical treatment of deterministic context-free languages is ideal for a better understanding of parsing and LR grammars. You gain 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. INTRODUCTION TO THE THEORY OF COMPUTATION, 3E, International Edition's comprehensive coverage makes this a valuable reference for your continued studies in theoretical computing.
650		0	_aMachine theory.
650		0	_aComputational complexity.
856	4	2	_3Contributor biographical information
856	4	2	_3Publisher description
856	4	1	_3Table of contents only
906			_a7 _bcbc _corigcop _d2 _encip _f20 _gy-gencatlg
942			_2ddc _cBK
998			_ayomna.nassar _bP _d20230601
998			_amona.romia _bR _d20230604
999			_c419 _d419