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.

  • Apple
  • Android
  • Windows Phone
  • Android

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

Introduction to Automata Theory, Languages, and Computation (3rd Edition) 3rd Edition

3.7 out of 5 stars 69 customer reviews
ISBN-13: 978-0321462251
ISBN-10: 0321462254
Why is ISBN important?
ISBN
This bar-code number lets you verify that you're getting exactly the right version or edition of a book. The 13-digit and 10-digit formats both work.
Scan an ISBN with your phone
Use the Amazon App to scan ISBNs and compare prices.
Trade in your item
Get a $61.26
Gift Card.
Have one to sell? Sell on Amazon

Sorry, there was a problem.

There was an error retrieving your Wish Lists. Please try again.

Sorry, there was a problem.

List unavailable.
Rent
$90.60
Due Date: Dec 18, 2016 Rental Details
  • FREE return shipping at the end of the semester.
  • Access codes and supplements are not guaranteed with rentals.
In Stock. Rented from Amazon Warehouse Deals , Fulfilled by Amazon
List Price: $151.00 Save: $60.40 (40%)
To Rent, select Shipping State from options above
More Buying Choices
8 New from $175.75 30 Used from $70.00
Free Two-Day Shipping for College Students with Prime Student Free%20Two-Day%20Shipping%20for%20College%20Students%20with%20Amazon%20Student


Free Kaplan PSAT/NMSQT 2017 eTextbook with 2 Practice Tests
Prep smarter, not harder with the Kaplan "PSAT/NMSQT 2017 Strategies, Practice & Review" eTextbook. Sponsored by Kaplan. Download Now
click to open popover

Customers Viewing This Page May Be Interested In These Sponsored Links

  (What's this?)
NO_CONTENT_IN_FEATURE
New York Times best sellers
Browse the New York Times best sellers in popular categories like Fiction, Nonfiction, Picture Books and more. See more

Product Details

  • 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: 1.6 pounds
  • Average Customer Review: 3.7 out of 5 stars  See all reviews (69 customer reviews)
  • Amazon Best Sellers Rank: #1,776,047 in Books (See Top 100 in Books)

Customers Viewing This Page May Be Interested In These Sponsored Links

  (What's this?)

Customer Reviews

Top Customer Reviews

Format: Hardcover
This is a good book - but as a revision of a much-revered classic of
the field, it's a bit of a disappointment.
Hopcroft & Ullman wrote the classic text way back in 1969, and then
revised it in 1979. It was pretty much the standard text the world
over for an introduction to the theory of computation.
But over the last two decades, more and more people have been studying
Computer science, and many of them have no time for theory and
formalism and all the 'dry stuff' ..........
The authors point out that because of such reasons and also because
nowadays there's little research in the theory of computation per se,
and more in its applications, they've written a book to cater to today's
students.
Which, in other words, means they've simplified the presentation, tried
to provide intuition whenever possible, given lots more examples and
done away with some of the more difficult material.
This approach puts the book into direct competition with Michael Sipser's
excellent 'Introduction to the theory of computation', a contest it
cannot win, though it might be a respectable second.
Almost all topics are motivated by giving examples of how they're
related to applications in the 'real world', and similar to
Sipser's 'proof idea' approach, the authors first present a topic
informally and then formally, thus gently leading the reader to
the formal proofs.
Read more ›
Comment 71 people found this helpful. 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
I've just passed my exam on Theory of Computation, and I've used both editions of this text. Frankly speaking, I couldn't choose one of the two should I keep only one of them.
Whereas the first was full of strict formalism, the second has traded this for a more discursive approach. Whereas the first reported theorems name (of their authors), the second has traded this for a richer bibliography at the end of the chapters. And more objectively, the first edition covered more "classical" topics with shorter treatments than the second, but this last treats survived topics with richer details (starting from the first chapter on mathematical basis for the course) and with updated examples of applications (XML and Markup Languages, e-commerce for DFA, etc).
This said, you know why I can't decide. A discursive approach is of course always desiderable, especially if you're completely new to a subject, but a strong notation is helpful in my mind because it improves communication and removes ambiguities. Hence, the best approach would probably have been a mix of the two, or halfway the two.
As a second matter, having a rich bibliography is surely helpful both for further studies and as a reference, but it's quite tedious to look at the index and be unable to find something like "Kleene theorem": you've to dive into bibligraphy to discover that "L is an L(DFA) if and only if it also is L(REG)" is something that has been studied by Kleene.
Read more ›
Comment 32 people found this helpful. 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
Like other reviewers, I find that the first ("classic") edition of H&U is an excellent reference when one is already familiar with some Theory of Compuation material. It was indispensible in at least the first half of the graduate Theory of Computation course that I took. H&U1 featured more detailed descriptions of automata construction than any other text. It did, however show its age.
In the second edition, the authors have added a few chapters near then end of the book on topics that simply did not exist twenty years ago (eg, there is a treatment of randomization).
At the same time, I find that the new edition is more readable for an undergrad. The introductory chapters expect less from students coming into contact with CS Theory for the first time. There are far more diagrams and sidebars and the overall tone of the book is far less formal.
On the one hand, this book has the potential to become the canonical undergrad text on Theory of Computation, I find that it has the feeling of a book that would appeal to undergrads much more readily than Kozen (which tends to intimidate students by the density of the material it manages to pack per page).
On the other hand, somehow I still prefer H&U1. One gets the feeling from H&U2 that it tries to hide something from students, whereas H&U1 pulled no punches.
And the cover art on H&U1 made it really distinctive (ala the cover of the Dragon Book), whereas H&U2 looks pretty much like any other modern textbook.
It's sad that H&U2 is a second edition of the book, rather than an entirely new book. It would have been wonderful to have both books in print as they serve somewhat orthogonal roles.
Comment 27 people found this helpful. 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