TY  - BOOK
AU  - Sipser Michael
TI  - Introduction to the theory of computation
SN  - 978-81-315-2529-6
U1  - 511.35 23
PY  - 2013///
CY  - New Delhi.
PB  - Cengage Learning
N1  - Introduction.
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.












ER  -