|
Automata and Computability (Undergraduate Texts in Computer Science)
 |
Author: Dexter C. Kozen
List Price: $54.95
Our Price: Click to see the latest and low price
ISBN: 0387949070
Publisher: Springer Verlag (April, 1997)
Edition: Hardcover
Sales Rank: 155,723
Average Customer Rating: 3.62 out of 5
|
Customer ReviewsRating: 5 out of 5
Very good as a textbook
This is the textbook I used for my Honors Introduction to Theory of Computing course which was taught by Kozen. This book is very well organized, each chapter corresponds exactly to one lecture, so it's almost like a collection of lecture notes in a sense. This book (and the course it's based on) provides a very good introduction to general theoretical aspects of computing. It's divided mainly into 3 sections, each covering a third of the course. First Finite Automata, then Context Free Languages and Pushdown Automata, finally Turing machines and general computability. It covers the basics very well, sprinkled with some optional lectures on more advanced topics such as Kleene Algebra (which is a favorite of Kozen)This course mainly deals with notions and models of computation, a previous reviewer noted that it doesn't include NP-completeness. There is a reason for this, because at Cornell University, this course is the first in a sequence, the second of which covers algorithms and complexity issues. That course covers NP-completeness and all the basic algorithm techniques. For those readers in a similar situation as the previous reviewer, it's difficult to find a more simple introduction to computer theory. I thought DFAs were the easiest part of the book/course, DFAs are the simplest models of computation, you can think of counting fingers as a form of DFA. I'm confident that anyone that can count will be able to understand the explanations of DFA in this book.
Rating: 1 out of 5
[bad] BOOK
This book is a [bad]! Who doesn't even know what is Automata forget this stupid book. This book start talking alot of blah... like for example: "a 'DFA' works like this" without even give an enough explanation about the concept of a 'DFA'. So only who has an idea of this subject can handle the information in the book at least in the second read. Good that I found internet sites to explain me in a better way about Automata. If I could I would give negative stars to this book!
Rating: 1 out of 5
Trash Book
This book is ... Who doesn't even know what is Automata forget this stupid book. This book start talking alot of blah... like for example: "a 'DFA' works like this" without even give an enough explanation about the concept of a 'DFA'. So only who has an idea of this subject can handle the information in the book at least in the second read :P . Good that I found internet sites to explain me in a better way about Automata. If I could I would give negative stars to this book!
Similar Products
· Artificial Intelligence: A Modern Approach (2nd Edition)
· Operating System Concepts
· Computers and Intractability: A Guide to the Theory of Np-Completeness (Series of Books in the Mathematical Sciences)
· Introduction to the Theory of Computation
· Introduction to Automata Theory, Languages, and Computation (2nd Edition)
|
