- Hardcover: 500 pages
- Publisher: Addison Wesley; 1 edition (1 Jan 1979)
- Language English
- ISBN-10: 020102988X
- ISBN-13: 978-0201029888
- Product Dimensions: 23.6 x 16 x 2.3 cm
- Average Customer Review: 3.7 out of 5 stars See all reviews (7 customer reviews)
- Amazon Bestsellers Rank: 75,455 in Books (See Top 100 in Books)
- See Complete Table of Contents
 Trade In this Item for up to £5.25
Get an extra £5 when you trade in books worth £10 or more until June 30, 2012. Trade in Introduction to Automata Theory, Languages and Computation (Addison-Wesley series in computer science) for an Amazon.co.uk gift card of up to £5.25, which you can then spend on millions of items across the site. Trade-in values may vary (terms apply). Find more products eligible for trade-in.
|
|
There is a newer edition of this item:
|
Product details |
Product Description
Product Description
This book presents automata theory, formal languages, and computational complexity as a coherent theory. It includes end-of-chapter questions, bibliographies, and exercises. Problems of highest and intermediate difficulty are marked respectively with double or single stars.
From the Back Cover
This book presents automata theory, formal languages, and computational complexity as a coherent theory. It includes end-of-chapter questions, bibliographies, and exercises. Problems of highest and intermediate difficulty are marked respectively with double or single stars.
020102988XB04062001
Suggested Tags from Similar Products(What's this?)Be the first one to add a relevant tag (keyword that's strongly related to this product)
|
Sell a Digital Version of This Book in the Kindle Store
If you are a publisher or author and hold the digital rights to a book, you can sell a digital version of it in our Kindle Store.
Learn more
What Other Items Do Customers Buy After Viewing This Item?
Customer Reviews
Most Helpful Customer Reviews
2 of 2 people found the following review helpful
The book is a great book if you are a beginner in automata theory. The exercises are also very good and the book makes your fundamentals very strong. It is a must for any student of theoretical computer science.
1 of 1 people found the following review helpful
A predecessor of the book was published in 1969 titled "Formal Languages and Their Relation to Automata." It was re-written in 1979. This is a classical textbook for last year undergraduate students or postgraduate students in computer science, especially those who are going to deal with computer languages, artificial intellegence, compiler design, computational complexity and so on. One of the author, J. E. Hopcroft, is the Turing Award winner of 1987.
I have both versions of the book and I'd like recommend every computer science student spend some time on reading it.
3 of 4 people found the following review helpful
This slim volume is the standard reference for research in automata theory, languages, and computation (especially regular and context-free languages). For that, it gets five stars. As a textbook for students, however, it is dense, uneven, and confusing throughout. Generations of novice computer scientists have been soured forever on theory by being forced to endure this book in their undergraduate- and graduate-level theory courses.
Conclusion: buy this book and keep it on your shelf, with the other essential references, but if you want to *learn* the material, look elsewhere -- for example, Michael Sipser's excellent new textbook, _Introduction to the Theory of Computation_.
Would you like to see more reviews about this item?
Were these reviews helpful?
Let us know
Most Recent Customer Reviews
Very Dissapointing
After Having finished reading this book I found myself asking more questions than I felt were answered for me. From a pedagogical point of view this book leaves much to be desire. Read more
Published on 9 Feb 1999
A must have for any student of computer science.
A classic text on the subject and a must have for any student of computer science. If you have taken a course in discrete math as taught by most CS departments then this book... Read more
Published on 4 Dec 1998
This book is a waste of time and money
It is unfortunate that Hopcraft and Ullman have been referred to as authors. Not only is the text indecipherable to anyone without a Ph.D. Read more
Published on 9 Jun 1998
The Best Computer Theory Book
Machine Theory, Formal Languages and Computational Complexity. If are there your interest, or are you a Computer
Science student, this is a obrigatory book. Read more
Science student, this is a obrigatory book. Read more
Published on 3 May 1997
Listmania!
Look for similar items by category
Look for similar items by subject
Feedback
- Would you like to update product info or give feedback on images?
- I am the Author, and I want to comment on my book.
- I am the Publisher, and I want to comment on this book.
