Introduction to Computer Theory / Edition 2

by Daniel I. A. Cohen

Overview

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.

Product Details

ISBN-13:	2900471137725
Publication date:	10/25/1996
Pages:	656
Product dimensions:	6.00(w) x 1.25(h) x 9.00(d)

About the Author

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.
Kleene'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.
Minsky's Theorem.
Variations on the TM.
TM Languages.
The Chomsky Hierarchy.
Computers.
Bibliography.
Indexes.

Editorial Reviews

New edition of a text which introduces the need for and the working of mathematical proof. Develops facility with the concepts, notations, and techniques of the theories of automata and pushdown automata theory, formal languages, and Turing machines. Provides historical perspective on the creation of the computer and its capabilities and limitations. Annotation c. by Book News, Inc., Portland, Or.

Booknews