- Hardcover: 431 pages
- Publisher: Course Technology; 2nd edition (February 15, 2006)
- Language: English
- ISBN-10: 0534950973
- ISBN-13: 978-0534950972
- Product Dimensions: 6.5 x 1 x 9.2 inches
- Shipping Weight: 1.6 pounds
- Average Customer Review: 36 customer reviews
- Amazon Best Sellers Rank: #154,093 in Books (See Top 100 in Books)
Enter your mobile number or email address below and we'll send you a link to download the free Kindle App. Then you can start reading Kindle books on your smartphone, tablet, or computer - no Kindle device required.
To get the free app, enter your mobile phone number.
Introduction to the Theory of Computation 2nd Edition
Use the Amazon App to scan ISBNs and compare prices.
Fulfillment by Amazon (FBA) is a service we offer sellers that lets them store their products in Amazon's fulfillment centers, and we directly pack, ship, and provide customer service for these products. Something we hope you'll especially enjoy: FBA items qualify for FREE Shipping and Amazon Prime.
If you're a seller, Fulfillment by Amazon can help you increase your sales. We invite you to learn more about Fulfillment by Amazon .
Customers who bought this item also bought
Customers who viewed this item also viewed
What other items do customers buy after viewing this item?
"For the market this text addresses, Introduction to the Theory of Computation, Second Edition is an outstanding text without peer." - Christopher Wilson, University of Oregon
"This is a model for readability, with a sensitivity for what students find difficult."
About the Author
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.
Top customer reviews
There was a problem filtering reviews right now. Please try again later.
Being a novice, I at first was afraid that the text of the book would be beyond my understanding. It was not. For sure, the proofs are difficult and may appeal to the person with a degree in computer science. But the copious diagrams, figures and tables are wonderful supplements to the understandable text. For the first time I really could grasp the subtleties of the finit automata, non-determinism, regular expressions, pushdown automata and other topics.
Certainly I can recommend this book to the beginner at computation theory, and even to the more advanced student who may want to review the topic.
So you will be able to test your understanding of the material.
And it's clear and easy, plus there is a full YouTube lectures
provided by a professor (you will find it on channel called UCDavis)
It covers the book so it's great to sort of watch and read
to maximize your learning.
Note: this book require prior knowledge of discrete mathematics.
There is even a nice appendix that explains all the mathematical notations.
I don't read much books that focuses so much on proofs so it's hard to compare this with its peers. But this should definitely be one of the better ones.