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.
Michael Sipser has taught theoretical computer science and mathematics at the Massachusetts Institute of Technology for the past 32 years. He is a Professor of Applied Mathematics, a member of the Computer Science and Artificial Intelligence Laboratory (CSAIL), and the current head of the mathematics department. He enjoys teaching and pondering the many mysteries of complexity theory.