- Hardcover: 750 pages
- Publisher: Pearson; 3 edition (July 9, 2006)
- Language: English
- ISBN-10: 0321455363
- ISBN-13: 978-0321455369
- Product Dimensions: 6.4 x 1.3 x 8.7 inches
- Shipping Weight: 2.2 pounds (View shipping rates and policies)
- Average Customer Review: 72 customer reviews
- Amazon Best Sellers Rank: #588,654 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 Automata Theory, Languages, and Computation (3rd Edition) 3rd 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 .
There is a newer edition of this item:
The Amazon Book Review
Author interviews, book reviews, editors picks, and more. Read it now
Frequently bought together
Customers who bought this item also bought
Customers who viewed this item also viewed
Top customer reviews
There was a problem filtering reviews right now. Please try again later.
(a) have already written a review about the book being "too hard"
(b) require (detailed) explanations or examples telling you how what's taught will help you land a Java job
(c) think mathematics or proofs aren't necessary with respect to programming or computer science
, it's not for you.
Is the book always an easy read? No, not for me.
Can it be fruitfully read? Yes. I have no "formal" education and this is the first book I've actively read about the topics it treats. Chapters on regular expressions (, properties of regular sets), and finite automata have been superb. I'm only on chapter three and have already bought a second copy of it so that I can have one on hand at work.
If you enjoy reading The Art of Computer Programming or other books as detailed as that one, you'll also enjoy this book. If you've read or do go read) portions of The Art of Computer Programming, don't feel like you've gained anything from it and thought its approach esoteric / too hard, this book's not for you.
If you enjoy proof, formality and studying hard topics directly applicable to the "real world", you'll love this book. Lexical analysis, formal languages, parsing, compilation, etc. all explicitly involve theorems and concepts contained in this book.
Automata theory should not be that hard.
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!!!