|
Introduction to Automata Theory, Languages, and Computation (2nd Edition)
 |
Author: John E. Hopcroft, Rajeev Motwani, Jeffrey D. Ullman
List Price: $101.00
Our Price: Click to see the latest and low price
ISBN: 0201441241
Publisher: Pearson Addison Wesley (14 November, 2000)
Edition: Hardcover
Sales Rank: 72,081
Average Customer Rating: 3.62 out of 5
|
Customer ReviewsRating: 1 out of 5
first edition is a classic, the second one unremarkable
The first edition is one of the best book in its field. A classic. A reference for many advanced courses in computer theory.Sadly, the second edition misses a great deal of the first edition. Many chapters were removed. Important lemmas and theorems are missing. I would gladly exchange my second edition for the first one, if it wasn't out of print. J.
Rating: 4 out of 5
Excellent introductory text, but has several weaknesses
This was my textbook for an introductory course on Finite Automata and Languages - I enjoyed it a lot and I think that the chapters until the Turing Machines are covered very well, along with good examples. As one previous reviewer has already mentioned, the exercises can get very hard as compared to what's actually presented - this I found not too good.The topics of complexity classes and NP-Completeness, as well as the chapter on Turing Machines are rather succint and do not cover the full depth. Papadimitriou's "Computational Complexity" does a better job in this respect, even though it is not at all flawless. Some might say that there is a reason why this book is introductory, but I argue that instead of doing a poor job, the authors should have maybe just made another book dealing with the above-mentioned topics. PS: My professor told me that the first edition was much better - maybe you could find it somewhere in the library, if interested.
Rating: 2 out of 5
Could be better
As a student using this book, I simply found it a little too difficult at times to grasp what the concepts were. The examples, at times were just too complicated, and could have been done better with easy to understand examples. Not so sure about this one. However, if you are already tamed in automata theory concepts, I'm sure you'll love it.
Similar Products
· Operating System Concepts
· Computers and Intractability: A Guide to the Theory of Np-Completeness (Series of Books in the Mathematical Sciences)
· Introduction to the Theory of Computation
· Introduction to Algorithms, Second Edition
· The Design and Analysis of Computer Algorithms
|
