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.
Introduction to Computer Theory 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.
Customer Reviews - Introduction to Computer Theory
Daniel Isaac Aryeh Cohen is an American mathematician and computer scientist who is now a professor emeritus at Hunter College.
Table of Contents
AUTOMATA THEORY. Background. Languages. Recursive Definitions. Regular Expressions. Finite Automata. Transition Graphs. Kleenea s Theorem. Finite Automata with Output. Regular Languages. Nonregular Languages. Decidability. PUSHDOWN AUTOMATA THEORY. Context--Free Grammars. Grammatical Format. Pushdown Automata. CFG = PDA. Non--Context--Free Languages. Context--Free Languages. Decidability. TURING THEORY. Turing Machines. Post Machines. Minskya s Theorem. Variations on the TM. TM Languages. The Chomsky Hierarchy. Computers. Bibliography. Indexes.
Additional information
GOR001966545
Introduction to Computer Theory by Daniel I. A. Cohen
Daniel I. A. Cohen
Used - Very Good
Paperback
John Wiley & Sons Inc
1996-10-11
648
0471137723
9780471137726
N/A
Book picture is for illustrative purposes only, actual binding, cover or edition may vary.
This is a used book - there is no escaping the fact it has been read by someone else and it will show signs of wear and previous use. Overall we expect it to be in very good condition, but if you are not entirely satisfied please get in touch with us.