Hide this

Results from Google Books

Click on a thumbnail to go to Google Books.

Introduction to Automata Theory, Languages, and Computation by John E. Hopcroft
Loading...

Introduction to Automata Theory, Languages, and Computation

by John E. Hopcroft

MembersReviewsPopularityAverage ratingConversations
260221,838 (3.95)None
Loading...
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.

Showing 2 of 2
A strong text, but quite formal. Not the most readable. ( )
  dpf | Nov 10, 2007 |
(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. ( )
  dominus | Jul 31, 2006 |
Showing 2 of 2
no reviews | add a review
You must log in to edit Common Knowledge data.
For more help see the Common Knowledge help page.
Series (with order)
Canonical Title
Original publication date
People/Characters
Important places
Important events
Related movies
Awards and honors
Epigraph
Dedication
First words
Quotations
Last words
Disambiguation notice
Publisher's editors
Blurbers
Book description

Amazon.com Amazon.com Review (ISBN 020102988X, Hardcover)

This book is a rigorous exposition of formal languages and models of computation, with an introduction to computational complexity. The authors present the theory in a concise and straightforward manner, with an eye out for the practical applications. Exercises at the end of each chapter, including some that have been solved, help readers confirm and enhance their understanding of the material. This book is appropriate for upper-level computer science undergraduates who are comfortable with mathematical arguments.

(retrieved from Amazon Tue, 05 Jan 2010 14:17:52 -0500)

(see all 3 descriptions)

The first test round has been closed. Visit the Open Shelves Classification group for details.

Quick Links

Ebooks Audio Swap
1 pay2/13

Popular covers

 

Help/FAQs | About | Privacy/Terms | Blog | Contact | LibraryThing.com | APIs | WikiThing | Common Knowledge | 47,216,778 books!