- Hardcover: 535 pages
- Publisher: Addison Wesley; 3 edition (July 15, 2006)
- Language: English
- ISBN-10: 0321462254
- ISBN-13: 978-0321462251
- Product Dimensions: 6.5 x 1 x 9.4 inches
- Shipping Weight: 2 pounds
- Average Customer Review: 78 customer reviews
- Amazon Best Sellers Rank: #1,880,186 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.
"Children of Blood and Bone"
Tomi Adeyemi conjures a stunning world of dark magic and danger in her West African-inspired fantasy debut. Learn more
Customers who bought this item also bought
Customers who viewed this item also viewed
What other items do customers buy after viewing this item?
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.
Gradiance is the most advanced online assessment tool developed for the computer science discipline. With its innovative underlying technology, Gradiance turns basic homework assignments and programming labs into an interactive learning experience for students. By using a series of “root questions” and hints, it not only tests a student’s capability, but actually simulates a one-on-one teacher-student tutorial that allows for the student to more easily learn the material. Through the programming labs, instructors are capable of testing, tracking, and honing their students’ skills, both in terms of syntax and semantics, with an unprecedented level of assessment never before offered.
Author interviews, book reviews, editors picks, and more. Read it now
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!!!