|
Loading... Introduction to Automata Theory, Languages, and Computationby John E. Hopcroft
LibraryThing recommendationsMember recommendationsLoading...
won't like
will probably not like
will probably like
will like
will love Sign up for LibraryThing to find out whether you'll like this book. A strong text, but quite formal. Not the most readable. ( )(This is a review of the first edition of this book.) This is another one of those rotten books that is difficult to read even when you already know the subject matter backward and forward. One of the book's largest problems is its overuse of notation to the point of fetishization. Good notation is an aid to clarity and thought; the notation in this book is clotted and turgid. The book also contains "applications" that aren't, overcomplicated examples of simple things, and makes the interesting parts dull. Its definition of NP-completeness is nonstandard and its explanation is confusing. Recommended alternative: Introduction to the Theory of Computation, by Michael Sipser. no reviews | add a review
References to this work on external resources.
|
||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
Introduction to Automata Theory, Languages, and Computation List of important publications in theoretical computer science Nondeterministic finite state machine |
| Book description |
|
(retrieved from Amazon Fri, 24 Apr 2009 07:57:53 -0400)
The first test round has been closed. Visit the Open Shelves Classification group for details.
Quick Links |