Introduction to the Theory of Computation – Michael Sipser – 3rd Edition


Gain a clear understanding of even the most complex, highly theoretical theory topics in the approachable presentation found only in the market-leading Introduction to the . The number one choice for today’s computational theory course, this revision continues the ’s well-know, approachable style with timely revisions, additional practice, and more memorable examples in key areas.

A new first-of-its-kind theoretical treatment of deterministic context-free is ideal for a better understanding of parsing and LR(k) grammars.

You gain a solid understanding of the fundamental mathematical of computer hardware, software, and applications with a blend of practical and philosophical coverage and mathematical treatments, advanced theorems and proofs. Introduction to the Theory of , comprehensive coverage makes this a valuable for your continued studies in theoretical computing.

Table of Content


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.

No Comments

  • Feedback: Leave your comments here!

    Your opinions and comments would be greatly appreciated.
    If you have comments or questions we've added this section so that we might have a dialogue with you.

Complete all fields

fifteen − five =