Introduction to Languages and the Theory of Computation

by John C. Martin

Book Overview

Introduction to Languages and the Theory of Computation helps students make the connection between the practice of computing and an understanding of the profound ideas that defines it. The book's... This description may be from another edition of this product.

• Format: Hardcover
• Language: English
• ISBN: 0070408459
• ISBN13: 9780070408456
• Release Date: January 1997
• Publisher: McGraw-Hill Companies
• Length: 512 Pages
• Weight: 1.65 lbs.
• Dimensions: 0.9" x 6.6" x 9.6"

Customer Reviews

Good textbook for computation theory starter

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.

A Rigorous Introduction

I've had the privilege of taking Prof. Martin's two-semester course from this text here at NDSU, and it has been quite enjoyable. The text provides a solid description and set of proofs for the more mathematically-minded students (such as myself). I think that the problem that many other reviewers seem to have faced is that their instructors fall short in their ability to teach this subject. Coupled with a good instructor (such as Prof. Martin) who gives very accessible and intuitive proofs in lecture (possibly by sacrificing rigor in favor of understanding), this text allows a student to have a solid understanding of the topic from a mathematically rigorous point of view.

Math lover's choice

Comments on a Mathematic book can be very divergent. This book is a good example, some people rate it 5 stars and other rated 1 star. (My humble opinions is that this is normally a sign that this is a good Math book).The book is very Mathematically rigorous, growing up the big tree step by step. It has no "friendly approaches" in its explaination but clean and dry proofs. I think this is what Mathematics book supposed to be.If you like Math you should like this book.

Amazingly clear writing style - easy to read

This is actually my favourite book in computer science. John C. Martin has a true gift for writing. The book is a good introduction to the subject for an intelligent but an unexperienced reader. The reason why I like this book is because it is very motivating - the author manages to demonstrate the beauty and elegance of the subject. The only weakness of the book I can think of is that it gives overly detailed explanations of fairly simple ideas. So if you prefer a less watered-down treatment of the subject, then Hopcroft & Ullman is the classic.

Rigorous and cumulative approach to computation

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.