Buy new:
Save with Used - Acceptable

Download the free Kindle app and start reading Kindle books instantly on your smartphone, tablet, or computer - no Kindle device required.
Read instantly on your browser with Kindle for Web.
Using your mobile phone camera - scan the code below and download the Kindle app.
Introduction to Automata Theory, Languages, and Computation 3rd Edition
Purchase options and add-ons
This classic book on formal languages, automata theory, and computational complexity has been updated to present theoretical concepts in a concise and straightforward manner with the increase of hands-on, practical applications. This new edition comes with Gradiance, an online assessment tool developed for computer science.
Please note, Gradiance is no longer available with this book, as we no longer support this product.
- ISBN-100321455363
- ISBN-13978-0321455369
- Edition3rd
- PublisherPearson
- Publication dateJune 29, 2006
- LanguageEnglish
- Dimensions6.7 x 1.4 x 9.55 inches
- Print length560 pages
Frequently bought together

Frequently purchased items with fast delivery
Product details
- Publisher : Pearson
- Publication date : June 29, 2006
- Edition : 3rd
- Language : English
- Print length : 560 pages
- ISBN-10 : 0321455363
- ISBN-13 : 978-0321455369
- Item Weight : 2.14 pounds
- Dimensions : 6.7 x 1.4 x 9.55 inches
- Best Sellers Rank: #1,468,753 in Books (See Top 100 in Books)
- #190 in Machine Theory (Books)
- #193 in Discrete Mathematics (Books)
- #5,600 in Computer Science (Books)
- Customer Reviews:
About the authors
Jeffrey David "Jeff" Ullman (born November 22, 1942) is a computer scientist and professor at Stanford University. His textbooks on compilers (various editions are popularly known as the Dragon Book), theory of computation (also known as the Cinderella book), data structures, and databases are regarded as standards in their fields.
Bio from Wikipedia, the free encyclopedia.
Discover more of the author’s books, see similar authors, read book recommendations and more.
Discover more of the author’s books, see similar authors, read book recommendations and more.
Customer reviews
Customer Reviews, including Product Star Ratings help customers to learn more about the product and decide whether it is the right product for them.
To calculate the overall star rating and percentage breakdown by star, we don’t use a simple average. Instead, our system considers things like how recent a review is and if the reviewer bought the item on Amazon. It also analyzed reviews to verify trustworthiness.
Learn more how customers reviews work on AmazonReviews with images

Top reviews from the United States
There was a problem filtering reviews. Please reload the page.
- Reviewed in the United States on May 18, 2025Format: PaperbackVerified PurchaseVery pleased with the quality
- Reviewed in the United States on January 14, 2013Format: HardcoverVerified PurchaseFor my Master Degree Studies on Computer Science, this book has been very helpful for an Automata Theory Course. Maybe there are a couple of chapters that need more understanding than others, but overall if you are interested on this field, this book is probably a good source of information in order to plan my thesis in a near future.
Most of my classmates purchased the First Edition Used and according to them the notes posted on some of those copies were nice.
Overall this book is a must have for every developer out there that wants to become a researcher in Math with Computer Science!!!
- Reviewed in the United States on September 22, 2014Format: HardcoverVerified PurchaseToo much abstractions, very little practical examples. The theory goes on and on forever. If you got a good professor, he/she should try to give out as many examples as possible. The homework is good but should provide more instructions at the beginning. Overall, a good book with some flaws.
Automata theory should not be that hard.
- Reviewed in the United States on August 16, 2016Format: PaperbackVerified PurchaseI bought this book for a class but I leave it out in the open to show guests how much a genius I am.
- Reviewed in the United States on October 23, 2012Format: HardcoverVerified PurchaseTo start off, the book is small, and written with a small font to compensate. The explanation of conecepts within the book are done in an extremely technical manner with few, if any, proper examples. The included electronic HW system designed for the book offers HW examples that are not adequately covered in the book. When providing an incorrect answer, the online interactive HW system provides generic feedback that consists of the page # in the book containing the concept to correctly answer the question... except when I would read the book I would be inundated with technical jargon, most of it not even relating to the question asked by the online HW system so I would never know if I was reading the right thing. At no point did the book seem to offer proper examples of concepts nor did I enjoy reading it in any context. The HW system did not impress me at all with its interactivity and that is something to be said from a Computer Science major. Not recommended for teaching or learning.
- Reviewed in the United States on January 14, 2021Format: PaperbackVerified PurchaseGood
Good
Images in this review
- Reviewed in the United States on January 28, 2018Format: PaperbackVerified PurchaseI bought the green paperback version without realizing it was the international version and now I can't use it for homework because the problems are different.
Top reviews from other countries
- Benjamin KorobkinReviewed in Canada on February 6, 2017
5.0 out of 5 stars Great!
Format: HardcoverVerified PurchaseShipped quickly for a good price. A++. Would buy from again.
- Hemant KumarReviewed in India on October 16, 2024
5.0 out of 5 stars Comprehensive and Well-Structured Guide for Students
The Introduction to Automata Theory, Languages and Computation: For VTU book is a solid resource for anyone studying automata, formal languages, and computation. As a student, I found it to be well-structured, making complex topics much easier to understand. The book covers essential concepts like finite automata, regular expressions, context-free grammars, Turing machines, and decidability in a clear and concise manner.
The explanations are supported with examples and illustrations, which are incredibly helpful for grasping difficult concepts. The exercises at the end of each chapter allow for good practice, and they are aligned with VTU’s syllabus, making it an excellent choice for students preparing for exams.
While the book is comprehensive, some sections could benefit from more detailed explanations or additional examples. Nevertheless, it's a valuable reference for both beginners and those looking to deepen their understanding of automata theory.
I highly recommend this book to VTU students or anyone seeking a clear introduction to the subject.
- LuigiReviewed in Italy on August 21, 2014
5.0 out of 5 stars A classical text, a must be in every computer scientist library!
Format: HardcoverVerified PurchaseThis is a classical textbook. It might be hard to follow in some of the proofs, but it is the most rigorous text on the argument.
- Alejandra GutierrezReviewed in Mexico on July 19, 2021
5.0 out of 5 stars Great book
It's original but its the Indian edition which is good at a much lower price
- BillyBadBoyReviewed in the United Kingdom on November 4, 2013
5.0 out of 5 stars Well explained introduction
This is an Indian print of this classic text. The quality of the paper/printing is not great, but certainly OK. And, of course, this version is MUCH cheaper than the normal version.
The book itself is written in a style that spells out the proofs quite patiently - it's quite easy to follow in comparison with other books I have on the same subject.