Introduction To Languages and The Theory of Computation [IMPORT] (Paperback)

~ (Author) "A set is determined by its elements..." (more)
Key Phrases: distinguishable with respect, unbounded minimalization, nonhalting states, Proof Suppose, Proof Let, Proof First (more...)

Product Details

• Paperback: 512 pages
• Publisher: McGraw-Hill Companies; Internat.2r.e. edition (1997)
• ISBN-10: 007115468X
• ISBN-13: 978-0071154680
• Shipping Weight: 1.6 pounds
• Average Customer Review: 3.0 out of 5 stars  See all reviews (23 customer reviews)
• Amazon.com Sales Rank: #4,103,254 in Books (See Bestsellers in Books)

Customer Reviews

Most Helpful Customer Reviews

13 of 15 people found the following review helpful:

5.0 out of 5 stars Rigorous and cumulative approach to computation, December 17, 1999

By	Rahman (CA, USA) - See all my reviews

This review is from: Introduction To Languages and The Theory of Computation (Hardcover)

Logic and linguistics interweave and become virtually indistinguishable through the unifying topic of computability. Any serious seeker of knowledge must be familiar with the underlying concepts of computation. Psychology, philosophy, computer science, the physical and metaphysical are all touched upon by this one subject.

The approach of this work is fairly standard. It begins with machines generating or recognizing languages of increasing inclusiveness and generality, and proceeds to further subject matter, computability and complexity. It opens with two introductory chapters covering the basics of set theory, inductive proofs, and linguistic concepts which will be utilized throughout the book. Each topic after this builds upon the previous ones systematically and gradually. Both mathematical/logical, and verbose prose descriptions are employed, to coax the reader through this intricate and immensely important subject.

One must be well grounded in reading mathematics. The introductory chapters will likely be insufficient for the neophyte, who may become frustrated as the material develops, even as gradual as this cumulation is. Rigorous proofs are provided, and the reader is expected to appreciate the underlying implications. One must exert some considerable personal effort to achieve this level.

This work stands at a middle ground in the subject, between the relatively informal approach of the excellent Sipser text, and the extremely thorough work by Hopcraft et al. It expects the reader to approach the subject with seriousness, yet provides gentler guidance through the more complex subtopics than other related works having this level of mathematical rigor.

6 of 6 people found the following review helpful:

1.0 out of 5 stars Horrible, October 15, 1998

By A Customer

This review is from: Introduction to Languages and the Theory of Computation (Hardcover)

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!

2 of 2 people found the following review helpful:

5.0 out of 5 stars Good textbook for computation theory starter, December 28, 2002

By	wenny binny (Albuquerque, NM USA) - See all my reviews

This review is from: Introduction to Languages and the Theory of Computation (Hardcover)

I read this book during my preparation for a comprehensive exam, which includes materials about theory of computation. I was bad at theory all the time, but reading this book removes all my confusions. It looks like lots of math at first glance, but all the theorems explained clearly after the declarations. This book is also very helpful to understand the fundamental theory for programming languages. I recommend this book for all new graduate students of computer science.