Introduction to Computer Theory-Teacher's Edition

by Daniel I.A. Cohen

This text strikes a good balance between rigor and an intuitive approach to computer theory. Covers all the topics needed by computer scientists with a sometimes humorous approach that reviewers found "refreshing." It is easy to read and the coverage of mathematics is fairly simple so readers do not have to worry about proving theorems.

Genres: Computer Science, Programming, Textbooks, Computers, Nonfiction

Paperback

First published April 16, 1986

Reviews

[Gerhard · Rating 5 out of 5]

You will not find a better, more lucid, simplified introduction to computer theory anywhere. The author attempts to stay away from obscure and confusing mathematical notation, and instead explains things in an informal laymen convention.
If you are prescribed this book in college be thankful, but also be sure to correct the multitude of errors and typos (about 20) scattered throughout the text. I hope the next revision will rectify this in an otherwise excellent source.

[Muzaffar]

this is best for student

[Mina]

this is really a good book for the introduction to automata

[Waseem]

hoow to see this book
plz rply
my id
nice_waseem88@yahoo.com

[Syedkhamsahassan]

1st i read then i tell

[Kashif Abbasi · Rating 4 out of 5]

hgh

[astaliegurec · Rating 4 out of 5]

4.0 out of 5 stars
Excellent, Accessible Book
September 28, 2005

This an excellent book. Basically, the whole point of it is to mathematically define what a computer is and prove that it works. The author does this by defining and manipulating mathematical alphabets and languages without resorting to any kind of advanced math. Starting from nothing, the whole thing leads up to Turing Machines. More specifically, according to the Preface, the goals of the book are:

"(1) to introduce a student of Computer Science to the need for and the working of mathematical proof; (2) to develop facility with the concepts, notations, and techniques of the theories of Automata, Formal Languages, and Turing machines; and (3) to provide historical perspective on the creation of the computer with a profound understanding of some of its capabilities and limitations."

The author did a wonderful job of it. Plus, unlike almost all other computer/math books I've read, this book is almost enjoyable to read. Again, as stated in the Preface:

"This book is written for students with no presumed background of any kind. Every mathematical concept used is introduced from scratch. Extensive examples and illustrations spell out everything in detail to avoid any possibility of confusion."

Astonishingly, those are all true statements. At a guess, I'd say that almost anyone interested in computers could get through this book without undue stress. To make it more meaningful, I'd suggest (only suggest) prerequisites of having programmed a computer and knowing some discrete math. From that point of view, it's odd that as of last year, this book was used in Florida State University's (FSU's) COT 4420: "Theory of Computation" course, which, obviously, is a 4000 level course requiring various prerequisites that put it out of the reach of all but senior (or graduate) level students.

Now, with all that glowing out of the way, there are a couple of small problems with the book. The first is simply that the exercises don't have any solutions. For the self-studier, that's a bad thing. In a school teaching environment, it's probably acceptable, though. The second problem is that after getting through the book, I simply have to ask: "So what? WHY should I learn this?" Again, in the Preface, the author states:

"Leaving aside the obvious worth of knowledge for its own sake, the terminology, notations, and techniques of Computer Theory are necessary in the teaching of courses on computer design, Artificial Intelligence, the analysis of algorithms, and so forth. Of all the programming skills undergraduate students learn, two of the most important are the abilities to recognize and manipulate context-free grammars and to understand the power of the recursive interaction of parts of a procedure. Very little can be accomplished if each advanced course has to begin at the level of defining rules of production and derivations."

But, in my experience, I have to say that except for one reference in one other book I've read, I've never seen any of this stuff used. Even more, I've never known anyone who even knew of anyone who used (or even knew of) any of it. EVERYTHING has been done at a much higher level of abstraction than alphabets, languages, and various levels of algorithms and machines up to Turing Machines. I'm not saying that the material in this book isn't used SOMEWHERE. But, I'd honestly have liked to have seen actual, specific, concrete cases: they'd be fascinating.

So, factoring those two nits in, I rate this book at 4 stars out of 5. If those two things don't bother you, then you could easily consider this a 5 star book.

[Will · Rating 2 out of 5]

This book has some good information on automata, regular expressions and computation theory. However, it is verbose, heavy reading, and unless you have a passion for descriptive math it could be extremely boring! I could not read the whole thing and had to skip many parts as I would fall asleep every time.

[Aixax Ali]

ghjghjkhjkgmhgkhjghgh

[Andrew · Rating 4 out of 5]

Read all the required chapters for class. I thought it was pretty well written, but would have liked to see more step by step examples.

[M Usman · Rating 5 out of 5]

i like this book

[Zulqernain]

its a good book

[Ahmad]

thank you