Trade in Yours
For a 2.29 Gift Card
Trade in
Have one to sell? Sell yours here
Sorry, this item is not available in
Image not available for
Colour:
Image not available

 
Tell the Publisher!
Id like to read this book on Kindle

Don't have a Kindle? Get your Kindle here, or download a FREE Kindle Reading App.

Introduction to Automata Theory, Languages and Computation (Addison-Wesley series in computer science) [Hardcover]

John E. Hopcroft , Jeffrey D. Ullman
3.6 out of 5 stars  See all reviews (9 customer reviews)

Available from these sellers.


Formats

Amazon Price New from Used from
Hardcover --  
Paperback --  
Trade In this Item for up to 2.29
Trade in Introduction to Automata Theory, Languages and Computation (Addison-Wesley series in computer science) for an Amazon Gift Card of up to 2.29, which you can then spend on millions of items across the site. Trade-in values may vary (terms apply). Learn more
There is a newer edition of this item:
Introduction to Automata Theory, Languages, and Computation Introduction to Automata Theory, Languages, and Computation 3.6 out of 5 stars (9)
Currently unavailable

Book Description

1 Jan 1979 Addison-Wesley series in computer science

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.



Product details

  • 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.6 out of 5 stars  See all reviews (9 customer reviews)
  • Amazon Bestsellers Rank: 515,232 in Books (See Top 100 in Books)
  • See Complete Table of Contents

Product Description

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

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
1 of 1 people found the following review helpful
5.0 out of 5 stars A book for computer scientists 14 April 1999
By A Customer
Format:Hardcover
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.
Comment | 
Was this review helpful to you?
2 of 2 people found the following review helpful
5.0 out of 5 stars Excellent book 30 Jun 1999
By A Customer
Format:Hardcover
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.
Comment | 
Was this review helpful to you?
4 of 5 people found the following review helpful
3.0 out of 5 stars Five-star reference, one-star textbook 5 Oct 1998
By A Customer
Format:Hardcover
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_.
Comment | 
Was this review helpful to you?
1.0 out of 5 stars Don't buy it. Do a favor to your self... 23 Nov 2013
By abu
Format:Paperback|Verified Purchase
This edition of this great book have almost all the images wrong. I have read it until page 70 and I lost most of the time trying to understand the examples until I realize, comparing with regular editions, that I was reading descriptions that don't have nothing to do with the images.....
Comment | 
Was this review helpful to you?
5.0 out of 5 stars Well explained introduction 4 Nov 2013
Format:Paperback|Verified Purchase
This is an Indian print of this classic text. The quality of the paper/printing is not great, but certainly OK. And, of course, this version is MUCH cheaper than the normal version.

The book itself is written in a style that spells out the proofs quite patiently - it's quite easy to follow in comparison with other books I have on the same subject.
Comment | 
Was this review helpful to you?
Would you like to see more reviews about this item?
Were these reviews helpful?   Let us know

Customer Discussions

This product's forum
Discussion Replies Latest Post
No discussions yet

Ask questions, Share opinions, Gain insight
Start a new discussion
Topic:
First post:
Prompts for sign-in
 

Search Customer Discussions
Search all Amazon discussions
   


Look for similar items by category


Feedback