TY  - BOOK
AU  - Sipser,Michael
TI  - Introduction to the theory of computation
SN  - 0619217642
U1  - 511.3 
PY  - 2006///
CY  - Boston, Mass.
PB  - Thomson/Course Technology
KW  - Machine theory
KW  - Computational complexity
N1  - Includes bibliographical references (p. 421-425) and index; Part One: Automato and languages: 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
ER  -