Message from Dean - May 8th 2007

I am currently testing out a new version of the APF Bridge Component - If you notice any errors within this demo store please drop me a line.

Binding: Hardcover
Dewey Decimal Number: 511.35
EAN: 9780534950972
Edition: 2
ISBN: 0534950973
Label: Course Technology
Manufacturer: Course Technology
Number Of Items: 1
Number Of Pages: 456
Publication Date: February 15, 2005
Publisher: Course Technology
Studio: Course Technology

---

Alternate Versions: Click to Display

Related Items:

• Introduction to Algorithms
• Artificial Intelligence: A Modern Approach (2nd Edition) (Prentice Hall Series in Artificial Intelligence)
• Introduction to Automata Theory, Languages, and Computation (3rd Edition)
• Operating System Concepts (7th Edition)
• Computer Organization and Design: The Hardware/Software Interface. Third Edition, Revised
• see more

Browse for similar items by category:

• Books > Specialty Stores > Custom Stores > New & Used Textbooks > Computer Science > Computer Science
• Books > Specialty Stores > Custom Stores > New & Used Textbooks > Computer Science > General AAS
• Books > Specialty Stores > Custom Stores > New & Used Textbooks > General AAS
• Books > Specialty Stores > Custom Stores > Qualifying Textbooks > General AAS
• Books > Subjects > Business & Investing > Industries & Professions > High-Tech

---

Editorial Review:

Amazon.com Review:
"Intended as an upper-level undergraduate or introductory graduate text in computer science theory," this book lucidly covers the key concepts and theorems of the theory of computation. The presentation is remarkably clear; for example, the "proof idea," which offers the reader an intuitive feel for how the proof was constructed, accompanies many of the theorems and a proof. Introduction to the Theory of Computation covers the usual topics for this type of text plus it features a solid section on complexity theory--including an entire chapter on space complexity. The final chapter introduces more advanced topics, such as the discussion of complexity classes associated with probabilistic algorithms.

Product Description:
This highly anticipated revision builds upon the strengths of the previous edition. Sipser's candid, crystal-clear style allows students at every level to understand and enjoy this field. His innovative "proof idea" sections explain profound concepts in plain English. The new edition incorporates many improvements students and professors have suggested over the years, and offers updated, classroom-tested problem sets at the end of each chapter.




Rating: - Running out of superlatives to describe this book
This book has unbelievably clear explanations. Actually it is so good that it makes the lecturer superfluous. For years I felt I did not really understand the proof of the Cook Levin theorem. Sure, I had Garey and Johnson, and I more or less could follow the proof, but I wouldn't have been able to reproduce it on my own. With this book, it has become crystal clear, and now I would be able to explain it in front of any audience without any preparation. If you're taking a computation course and this is not your assigned textbook, go buy it now!

---

Rating: - Excellent presentation of the material
I would recommend this book to anyone looking to learn the basics of computation theory and formal languages or for someone looking to revisit this material after an absence.

The book is very readable and covers the basics in a systematic fashion. I haven't looked at this material since my university days, but found it very easy to read and digest.

---

Rating: - A very nice book for undergraduates and graduates to understand computation theory.
I had read a few other books on automata, but I was not able to get clear notion about pumping lemmas, decidability and so on. However, when I read the 1st edition of this book, finally, I got those concepts. One of great things in this book is proof ideas. This book has very clear and concise explanations about proofs.
I bought 2nd edition of this book, since it has lots of solved problems and exercises. those solved problems will boost your understanding the text and they contains a few things you should know, but omitted in the text.
If you don't understand many concepts in automata and computability with other textbooks, I strongly recommend this book.

---

Rating: - Don't be afraid of the proofs
This is a great book. The topics are covered in a clear and interesting way. I came to this book after having been exposed to NFA's and DFA's in a compiler course and this exposition is much more enlightening. The proofs in this book are very well written in my opinion, very clear. Studying proof techniques in a book such as Solow's "How to Read and Do Proofs" will prepare you well to understand the proofs in this book.

---

Rating: - dont buy this version
Go buy an international version which is a lot cheaper than this, and they have the same contents. This version is also printed in Black and White and the paper is really cheap. Don't make a mistake like me buying same product for 90$ more. Again, the only difference between hardcover and softcover(international ver) is the price.

---