| 000 | 00919nam a22001937a 4500 | ||
|---|---|---|---|
| 003 | OSt | ||
| 005 | 20191112182747.0 | ||
| 008 | 131202b2007 ii ||||g |||| 001 0 eng d | ||
| 020 | _a81 315 05138 (pbk) | ||
| 040 | _cNCL | ||
| 082 |
_a511.352 _bSIP-T 2007 2481 |
||
| 100 | 1 | _aSipser, Michael. | |
| 245 | 1 |
_aTheory of computation : _cby Michael Sipser. |
|
| 260 |
_aNew Delhi : _bCourse Technology ; _c2007c. |
||
| 300 |
_avi, 346 p. : _bill. ; _c24 cm. |
||
| 500 | _aIndex included. | ||
| 505 | _a1. Introduction 11 2. PART ONE: Automata and Languages 2.1. Regular Language 2.2. Context-Free Languages 3. PART TWO: Computability Theory 3.1. The Church-Turing Thesis 3.2. Decidability 3.3. Reducibility 3.4. Advanced Topics in Comutability - PART THREE: COMPLEXITY THEORY 4.1. Time Complexity 4.2. Space Complexity 4.3. Intractability 4.4. Advanced topics in complexity theory 4. | ||
| 942 |
_2ddc _cBK |
||
| 999 |
_c1688 _d1688 |
||