This highly anticipated revision builds upon the strengths of the previous edition. Sipser's candid, crystal-clear style allows students at ever... read full description
reviews
Nov 28, 2011
Ro
rated it: 
Great intro to CS Theory and is a recommended book for all my theoretical graduate classes.
0 comments
like
(1 person liked it)
May 03, 2011
Jamie
rated it: 
I've read Introduction to Automata Theory by Hopcroft, et al, and parts of Elements of the Theory of Computation, and Sipser's book is definitely the most clear. I have no doubt that it is one of the clearer books on the subject in general, but its difficult to follow the more advanced proofs and some of the chapter problems without a very solid foundation in mathematics. I find it difficult to follow mathematical symbology, and hence some of the proofs are beyond me. I think its a matter of pra
More...
Mar 27, 2011
Joecolelife
rated it:
I think that this book is by far the best introductory text on theory of computation and complexity that I have read so far. I would recommend the aho ulmann book as a companion after having gone through this book to strengthen your knowledge. But, this book introduces stuff like never before. Simply amazing.. buy it even if you are planning to take a course and the instructor is using some other textbook, its that good!!
May 01, 2011
Plamen
rated it:
Automata theory and grammars. It can be combined quite good with http://www.goodreads.com/book/show/17565...
Oct 19, 2011
Had to shelve this about a third in to focus on classes, but looking forward to finishing it.
Nov 28, 2011
Nick
rated it:
Runs out of depth really early, but I learned my basics of automata theory from this lovely little hardback and will always love it for that. Remains the clearest exposition of the fundamental formalisms of which I'm aware. There's plenty of books with much more meat, and you'll inevitably need them -- browse my library for examples.
Jun 21, 2008
Emily
rated it:
I had an incomprehensible professor, and this great little book got me through the class with flying colors. Clear, and a great resource. How often do you find yourself keeping a computer science textbook because you liked it?
Mar 25, 2007
javier
rated it:
what i learned from this book: everything about the theory of computation. this book is crystal clear. mike sipser is a master of making the most complex ideas lucid to all. some very cool ideas are covered too.
May 09, 2008
Paul
rated it:
Not that I've read a lot of automata books, but you'd have a hard time convincing me there was one more accessible than this. Sipser rocks and his writing is amazingly clear with insightful examples.
May 04, 2011
Steven
rated it:
I read this for a class in the Theory of Computation. The book was very clear and as easy to read as any other theoretical math textbook.
Nov 28, 2011
dead letter office
rated it:
if you must learn computational complexity, this is the easiest way to do it. introductory undergraduate text.
Nov 28, 2011
Shobana
rated it:
its very easy to understand..................
the book is very helpful for me..............
the book is very helpful for me..............
Nov 28, 2011
Never actually took a computational theory course in college - guess it's time to read now.
Dec 17, 2009
Shani
rated it:
This is the textbook that makes you love what you are studying. Beautifully and simply explained.
Nov 28, 2011
Math alert! Although it seems like the computer science math notation needs a bit of work
Feb 09, 2012
Feb 05, 2012
Feb 02, 2012
Feb 01, 2012
Jan 30, 2012
Jan 29, 2012
Jan 29, 2012
Jan 27, 2012
