Vous voulez voir cette page en français ? Cliquez ici.


or
Sign in to turn on 1-Click ordering.
More Buying Choices
Have one to sell? Sell yours here
Introduction to Automata Theory, Languages, and Computation
 
See larger image 
Share your own customer images
Publisher: learn how customers can search inside this book.

Introduction to Automata Theory, Languages, and Computation [Hardcover]

John E. Hopcroft (Author), Rajeev Motwani (Author), Jeffrey D. Ullman (Author)
3.7 out of 5 stars  See all reviews (18 customer reviews)
List Price: CDN$ 127.65
Price: CDN$ 106.95 & this item ships for FREE with Super Saver Shipping. Details
You Save: CDN$ 20.70 (16%)
o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o
Temporarily out of stock.
Order now and we'll deliver when available. We'll e-mail you with an estimated delivery date as soon as we have more information. Your account will only be charged when we ship the item.
Ships from and sold by Amazon.ca. Gift-wrap available.

Formats

 Amazon Price New from Used from
Hardcover CDN $106.95   -- --
Paperback --   -- --
Multimedia CD --   -- --
There is a newer edition of this item:
Introduction to Automata Theory, Languages, and Computation with Gradiance Access Card PKG Introduction to Automata Theory, Languages, and Computation with Gradiance Access Card PKG 3.7 out of 5 stars (18)
CDN$ 128.46
Not in stock; order now and we'll deliver when available

Product Details

Product Description

Book Description

It has been more than 20 years since this classic book on formal languages, automata theory, and computational complexity was first published. With this long-awaited revision, the authors continue to present the theory in a concise and straightforward manner, now with an eye out for the practical applications. They have revised this book to make it more accessible to today's students, including the addition of more material on writing proofs, more figures and pictures to convey ideas, side-boxes to highlight other interesting material, and a less formal writing style. Exercises at the end of each chapter, including some new, easier exercises, help readers confirm and enhance their understanding of the material.

Features and Benefits

NEW! Completely rewritten to be less formal, providing more accessibility to todays students.
NEW! Increased usage of figures and pictures to help convey ideas.
NEW! More detail and intuition provided for definitions and proofs.
NEW! Provides special side-boxes to present supplemental material that may be of interest to readers.
NEW! Includes more exercises, including many at a lower level.
NEW! Presents program-like notation for PDAs and Turing machines.
NEW! Increased number of worked solutions and new programming exercises available online.

From the Back Cover

This classic book on formal languages, automata theory, and computational complexity has been updated to present theoretical concepts in a concise and straightforward manner with the increase of hands-on, practical applications. This new edition comes with Gradiance, an online assessment tool developed for computer science.

 

Gradiance is the most advanced online assessment tool developed for the computer science discipline.  With its innovative underlying technology, Gradiance turns basic homework assignments and programming labs into an interactive learning experience for students.  By using a series of “root questions” and hints, it not only tests a student’s capability, but actually simulates a one-on-one teacher-student tutorial that allows for the student to more easily learn the material.  Through the programming labs, instructors are capable of testing, tracking, and honing their students’ skills, both in terms of syntax and semantics, with an unprecedented level of assessment never before offered. 

--This text refers to an alternate Hardcover edition.

Tag this product

 (What's this?)
Think of a tag as a keyword or label you consider is strongly related to this product.
Tags will help all customers organize and find favorite items.
Your tags: Add your first tag
 
See most popular tags

What Other Items Do Customers Buy After Viewing This Item?

› Explore similar items
 

Customer Reviews

18 Reviews
5 star:
 (8)
4 star:
 (5)
3 star:    (0)
2 star:
 (2)
1 star:
 (3)
 
 
 
 
 
Average Customer Review
3.7 out of 5 stars (18 customer reviews)
 
 
 
 
Share your thoughts with other customers:
Most helpful customer reviews

1.0 out of 5 stars first edition is a classic, the second one unremarkable, Nov 5 2003
By 
This review is from: Introduction to Automata Theory, Languages, and Computation (Hardcover)
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.

Help other customers find the most helpful reviews 
Was this review helpful to you? Yes No


4.0 out of 5 stars Excellent introductory text, but has several weaknesses, Jun 24 2003
This review is from: Introduction to Automata Theory, Languages, and Computation (Hardcover)
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.

Help other customers find the most helpful reviews 
Was this review helpful to you? Yes No


2.0 out of 5 stars Could be better, Jun 12 2003
By 
Michael Carey - See all my reviews
(REAL NAME)   
This review is from: Introduction to Automata Theory, Languages, and Computation (Hardcover)
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.
Help other customers find the most helpful reviews 
Was this review helpful to you? Yes No

Share your thoughts with other customers: Create your own review
Want to see more reviews on this item?
› Go to Amazon.com to see all 29 reviews  3.8 out of 5 stars 
 
 		 Most recent customer reviews











Only search this product's reviews


Listmania!

Create a Listmania! list

Look for similar items by category

Look for similar items by subject


















i.e., each book must be in subject 1 AND subject 2 AND ...

Feedback

Would you like to update product info or give feedback on images?

Amazon.ca Privacy Statement Amazon.ca Shipping Information Amazon.ca Returns & Exchanges