DisplayCover
Preface
Contents
Index
Glossary
Models
Rogues
| |
Table of Contents

-
The Theory of
Computing
-
A Simple Computing
Model: the Finite State Automaton and Regular Languages
-
Extending the Computing Model with a Stack: Pushdown Automata and Context Free Languages
-
Allowing Writing to the Tape in Restricted Ways: Linear Bounded Automata
and Context Sensitive Languages
-
The Most Powerful Computing Model: Turing Machines, Algorithms, and
Phrase Structure Languages
-
The Limits of Computing: Computability and Intractability

|