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


Gain a clear understanding of even the most complex, highly theoretical computational theory topics in the approachable presentation found only in the market-leading Introduction to the Theory of Computation. The number one choice for today’s computational theory course, this revision continues the book’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 languages is ideal for a better understanding of parsing and LR(k) grammars.

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

View more

  • 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.
  • Citation
    • Full Title: Introduction to the Theory of Computation
    • Author/s:
    • ISBN-10: 113318779X
    • ISBN-13: 9781133187790
    • Edition: 3rd Edition
    • Topic: Computer
    • Subtopic: Theory Of Computation
    • File Type: eBook
    • Idioma: English

Leave us a comment

No Comments

Notify of
Inline Feedbacks
View all comments
Would love your thoughts, please comment.x