Introduction to Computer Theory by Daniel I. A. Cohen

Book Title Introduction to Computer Theory
Citation Cohen (1996)
Author Daniel I. A. Cohen
Edition 2nd Edition
ISBN-13 978-0-471-13772-6
Publisher Wiley
URL Amazon Google
Download Click Here
Course CS402 - Theory of Automata
Instructor Dr. Shahid Siddiqi

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.

Automata theory. Background. Languages. Recursive definitions. Regular expressions. Finite automata. Transition graphs. Kleene's theorem. Nondeterminism. Finite automata with output. Regular languages. Nonregular languages. Decidability. Pushdown automata Theory. Context-free grammars. Trees. Regular grammars. Chomsky normal form. Pushdown automata. CFG=PDA. Context-free languages. Non-context-free languages. Intersection and complement. Parsing. Decidability. Turing theory. Turing machines. Post machines. Minsky's theorem. Variations on the TM. Recursively enumerable languages. The encoding of turing machines. The chomsky hierarchy. Computers. Bibliography. Table of theorems.

Related Books:

Introduction to Languages and the Theory of Computation by John C. Martin