Buy Used
CDN$ 29.50
Used: Like New | Details
Sold by ShopWins
Condition: Used: Like New
Comment: Lilke New. Possible remainder mark.
Have one to sell?
Flip to back Flip to front
Listen Playing... Paused   You're listening to a sample of the Audible audio edition.
Learn more
See all 2 images

Introduction to the Theory of Computation Hardcover – Dec 1996

4.7 out of 5 stars 37 customer reviews

See all formats and editions Hide other formats and editions
Amazon Price
New from Used from
"Please retry"
CDN$ 55.95 CDN$ 23.05

There is a newer edition of this item:

Introduction to the Theory of Computation
CDN$ 132.05
Usually ships within 3 to 4 weeks.

Harry Potter and the Cursed Child
click to open popover

No Kindle device required. Download one of the Free Kindle apps to start reading Kindle books on your smartphone, tablet, and computer.
Getting the download link through email is temporarily not available. Please check back later.

  • Apple
  • Android
  • Windows Phone
  • Android

To get the free app, enter your mobile phone number.

Product Details

  • Hardcover: 416 pages
  • Publisher: Course Technology Ptr (Sd) (December 1996)
  • Language: English
  • ISBN-10: 053494728X
  • ISBN-13: 978-0534947286
  • Product Dimensions: 24 x 16.1 x 2.1 cm
  • Shipping Weight: 748 g
  • Average Customer Review: 4.7 out of 5 stars 37 customer reviews
  • Amazon Bestsellers Rank: #202,396 in Books (See Top 100 in Books)
  •  Would you like to update product info, give feedback on images, or tell us about a lower price?

  • See Complete Table of Contents

Product Description

From Amazon

"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.

About the Author

Ph.D. University of California - Berkeley

What Other Items Do Customers Buy After Viewing This Item?

Customer Reviews

4.7 out of 5 stars
Share your thoughts with other customers

Top Customer Reviews

Format: Hardcover
This book is aimed as an introductory text book on computer science theory. The book is suited for both undergraduate and graduate studies. The first three chapters of the book, regular expressions, context free languages and the church-turing thesis are apt for an introductory class for the undergraduate level. The remaining 7 chapters provide more than enough content for advanced undergraduate or graduate studies.
This is the first book on computer science theory that I have seen, which is actually written in understandable English. As compared to the previous introductory texts by Hopcroft or Papadimitriou, Sipser shuns writting the entire book using just symbols of formal mathematics. This is not to say that there is no formalism in the book. There is adequate use of formal mathematics in the proofs of the book, but not so much as to scare even in most intrepid readers like in previous books on this subject.The fact I liked most about this book is that every proof in the book is accompanied by a "Proof Idea" which explains using diagrams and plain english how exactly the proof works. This followed by the formal proof. The problems at the end of each chapter are fairly interesting, and some of the * marked problems can be fairly challenging for a first time student.
Another amazing thing about this book is the amount of content it covers. I would have never expected a book of only 400 pages to cover computer science theory all the way from introductory undergraduate to advanced graduate levels. This is because, the author focusses only on core concepts and strives to make them as clear as possible. For example, this book has only one chapter on regular expressions, while every other book that I have seen has at least 3-4 chapters full of gory details.
Read more ›
Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback.
Sorry, we failed to record your vote. Please try again.
Report abuse
Format: Hardcover
This book is by far the best book that I read!!! It presents topics in a very interesting and readable way.
My advice is read this book if you an undergrad student, even though instructor might be using a different book. If you are a grad student this books makes an excellent reference for refreshing your knowledge of Computer Theory. Computer Theory is not my area of interest, but this book makes it very interesting and fun area; which is quiet unusual for Computer Theory books.
I am a grad student taking advanced "Computer Theory" class. I have bought couple books including this one, and checked out from library another 6. This book in an introductory book and it has excellent coverage of the basics, and it has some brief but very good coverage of advanced topics as well. I read this book every time to refresh my knowledge before I go on to more in depth topics. The only thing that I wish, is that the undergrad course that I have taken a number years ago was using this book; and/or I read this book when I was an undergrad.
Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback.
Sorry, we failed to record your vote. Please try again.
Report abuse
Format: Hardcover
Every Computer Science who wants to do Theory of Computation should have this book. Theory of Computation is not that easy to grasp at first, but after a while you'll like it. However, this book doesn't have a solution companion book, which is very frustrating because no one should expect a senior student to know the right answer to some of the questions in the book as the solutions are tricky sometimes.
However, this is the only good book on Theory of Computation for beginners, sadly so. It's just not good enough to earn a 5-star.
I struggled when doing the course with this book because as I was trying to do the questions in the book, I had no references whether I was on the right track or not. And trust me, without the solution book, some instructors don't know how to solve some of the questions either, thus don't expect a student to do it all.
I don't like the idea of holding back the solution book but only instructors have access to it. What good is it if students can't check or learn from the solution.
If you have any other good book on Theory of Computation that has an accompanying solution book, please email me, I'll be much interested because Theory of Computation is what I want to pursue in Grad school.
Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback.
Sorry, we failed to record your vote. Please try again.
Report abuse
Format: Hardcover
Michael Sipser has an undoubted gift for writing on this subject. The book is a coincise and easy read. But be cautious, this doesn't mean superficial and poor. The book contains all the material needed for a good course on Theory of Computation and Complexity. Perhaps it has not plenty of details like other books as Hopcroft & Ullman or Kozen or Papadimitrou, but don't underestimate the vastity of the treated topics, what is important is that every time you finish a chapter, you have the sensation that you've learned what you should have to. And probably you did due to Sipser's writing style, provided that you can afford to skip "some" more detailed/advanced topics. Or you might just be looking for some further stuff like Myhill-Nerode or Rabin-Shepherdson theorems or Chomsky Hierarchy for example, and you would have to look elsewhere for them. However, I've never been told that the best book is the most complete one. As long as I've learned, the best book is the one that best fits your needs, and that fitting these needs it suceeds to transmit the knowledge you're looking for in an effective way. That's why if this stuff is not required by your course, you would be perfectly fine with this book in your hands.
Proofs on theorems are given virtually always in two steps: first you're presented with the idea that lies behind the proof, and then you get the proof itself in a more rigorous fashion. Again, Sipser strikes here because it's harder NOT to understand one of his proofs than the contrary simply because the presentation is always clear and understandable.
As a matter of fact, Sipser (as he point out in the preface) almost always avoid to overload proofs given by construction with more rigorous following proofs (e.g.
Read more ›
Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback.
Sorry, we failed to record your vote. Please try again.
Report abuse

Most recent customer reviews