Introduction to the Theory of Computation, 3rd Edition
- Michael Sipser Massachusetts Institute of Technology
- ISBN-10: 113318779X | ISBN-13: 9781133187790
- 504 Pages
- Previous Editions: 2006, 1997, 1996
- © 2013 | Published
Now you can clearly present even the most complex computational theory topics to your students with Sipser's distinct, market-leading INTRODUCTION TO THE THEORY OF COMPUTATION, 3E. The number one choice for today's computational theory course, this highly anticipated revision retains the unmatched clarity and thorough coverage that make it a leading text for upper-level undergraduate and introductory graduate students. This edition continues author Michael Sipser's well-known, approachable style with timely revisions, additional exercises, 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. This edition's refined presentation ensures a trusted accuracy and clarity that make the challenging study of computational theory accessible and intuitive to students while maintaining the subject's rigor and formalism. Readers 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, 3E's comprehensive coverage makes this an ideal ongoing reference tool for those studying theoretical computing.
PART 1: AUTOMATA AND LANGUAGES.
1. Regular Languages.
2. Context-Free Languages.
PART 2: COMPUTABILITY THEORY.
3. The Church-Turing Thesis.
6. Advanced Topics in Computability Theory.
PART 3: COMPLEXITY THEORY.
7. Time Complexity.
8. Space Complexity.
10. Advanced Topics in Complexity Theory.
"The text meets my objectives very well. The author presents the material in an appealing manner, making a hard subject accessible and intuitive to the students. He manages to do that while maintaining the rigor and formalism that the subject warrants. The book has a lot of information packed in it, and can serve as a reference book for students interested in research in theoretical CS."— Dr. Hrishikesh Goradia, Francis Marion University
"As one of my students puts it, the book is 'fun to read and helps him learn the subject better'."— Dr. Hrishikesh Goradia, Francis Marion University
"This is a model for readability, with sensitivity for what students find difficult."— John Neitzke, Truman State University
"Excellent prose (simple and succinct) with very good diagrams. It is by far the best presentation of automata in the business."— Robert M. Marmorstein, Longwood University
All supplements have been updated in coordination with the main title. Select the main title's "About" tab, then select "What's New" for updates specific to title's edition.
For more information about these supplements, or to obtain them, contact your Learning Consultant.
Written by the text book author to ensure accuracy and continuity with the text, this straight-forward Solutions Manual offers trusted solutions that correspond with all of the exercises in this edition. Please note: this supplement is PRINT ONLY, and not available online. Also, this Solutions Manual and the Instructor Manual are one and the same.