| 000 | 00872nam a22001577a 4500 | ||
|---|---|---|---|
| 008 | 210201b ||||| |||| 00| 0 eng d | ||
| 020 | _a978-81-315-2529-6 | ||
| 082 |
_223 _a511.35 _bSIP |
||
| 100 | _aSipser Michael | ||
| 245 |
_aIntroduction to the theory of computation / _cMichael Sipser. |
||
| 250 |
_a3rd ed. _b2013. |
||
| 260 |
_aNew Delhi. _bCengage Learning; _c2013. |
||
| 300 |
_avi-458 p. _bsoftbound _c15x24cm |
||
| 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. | ||
| 942 |
_2ddc _cBK |
||
| 999 |
_c6541 _d6541 |
||