Product Description

Introduction to Languages and the Theory of Computation is an introduction to the theory of computation that emphasizes formal languages, automata and abstract models of computation, and computability; it also includes an introduction to computational complexity and NP-completeness. Through the study of these topics, students encounter profound computational questions and are introduced to topics that will have an ongoing impact in computer science. Once students have seen some of the many diverse technologies contributing to computer science, they can also begin to appreciate the field as a coherent discipline. A distinctive feature of this text is its gentle and gradual introduction of the necessary mathematical tools in the context in which they are used. Martin takes advantage of the clarity and precision of mathematical language but also provides discussion and examples that make the language intelligible to those just learning to read and speak it. The material is designed to be accessible to students who do not have a strong background in discrete mathematics, but it is also appropriate for students who have had some exposure to discrete math but whose skills in this area need to be consolidated and sharpened.

Product Details

• Amazon Sales Rank: #177491 in Books
• Published on: 2002-09-01
• Original language: English
• Binding: Hardcover
• 543 pages

From the Publisher
Numerous examples and informal discussions.
Extended discussion of mathematical induction, including recursive definitions and structural induction
Improved introduction to computational complexity.
Inclusion of Ogden's Lemma.

Customer Reviews

Don't buy this book
This is by far the worst text book I have ever read! Very poorly written and difficult to read. Even the simplest subject which I picked up in a few minutes from another source were nearly impossible to learn from this book. Get a different book.

Horrible
One word summarized this book--horrible. This book sucks to the max! It's confusing and hard to understand. If it is your desire to be confused and be confusing then read this book. ANY other book is infinitely better than this one such as: "Introduction to the Theory of Computation" by Michael Sipser (really good AND got good reviews from other people here; see for yourself; shows I'm not alone) or "Languages and Machines" by Thomas Sudkamp (pretty good) or "Computable Languages and Abstract Machines" (excellent) by Alan Parkes or "The Language of Machines" by Robert Floyd and Richard Beigel. Trust me. I have examined ALL five of these books and John Martin's is THE worst. Don't waste your money on this one. Take it from an average person that likes to read (obviously) and strives to learn but not from someone who can't explain things well!

Computer science fundamentals
I don't think the previous reviewers of this book are entirely fair. I just read it again, and it strikes me as odd that a book that has nice worked out proofs of every major theorem(the proofs are fairly detailed, typical undergraduate level), many relevant examples, and exercises on many levels of difficulty can get an average rating this low.

It has a few typoes but except from that, I think this book is somewhere between high average and good. Three stars would be fair, as would four depending on taste. One or two stars is simply NOT fair.

BUT: You need a fairly high level of mathematical sophistication to apreciate this book! It is about the theory of computer science (ie mathematics) and not a practitioneers handbook although it has many nice algorithms!