| 000 | 01208nam a2200241Ia 4500 | ||
|---|---|---|---|
| 003 | NULRC | ||
| 005 | 20250520100703.0 | ||
| 008 | 250520s9999 xx 000 0 und d | ||
| 020 | _a9781133187790 | ||
| 040 | _cNULRC | ||
| 050 | _aQA 267 .S57 2013 | ||
| 100 |
_aSipser, Michael _eauthor |
||
| 245 | 0 |
_aIntroduction to the theory of computation / _cMichael Sipser |
|
| 250 | _aTHIRD EDITION | ||
| 260 |
_aAustralia : _bCengage Learning Asia Pte Ltd, _cc2013 |
||
| 300 |
_axxii, 458 pages : _billustrations ; _c24 cm. |
||
| 365 | _bUSD433.69 | ||
| 504 | _aIncludes bibliographical references and index. | ||
| 505 | _aPart one. Automata and language -- 1. Regular languages -- 2. Context-free languages -- Part two : Computability theory -- 3. The Church-Turing thesis -- 4. Decidability -- 5. Reducibility -- 6. Advanced topics in computability theory -- Part three : Complexity theory -- 7. Time complexity -- 8. Space complexity -- 9. Intractability -- 10. Advanced topics in complexity theory. | ||
| 520 | _aThe third edition includes an entirely new section on deterministic context-free languages with connections to parsing and LR(k) grammars. | ||
| 650 | _aMACHIEN THEORY | ||
| 942 |
_2lcc _cBK |
||
| 999 |
_c11444 _d11444 |
||