Introduction to computer theory

Front Cover
Wiley, Jan 16, 1991 - Computers - 838 pages
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.

From inside the book

What people are saying - Write a review

User Review - Flag as inappropriate

hh

Contents

Background
3
Languages
9
Number Brief Description Page 1 S S
21
Copyright

62 other sections not shown

Other editions - View all

Common terms and phrases

About the author (1991)

Daniel A. Cohen is associate professor of history at Case Western Reserve University.

Bibliographic information