| Descript |
xviii, 667 p. : ill. ; 25 cm |
| Contents |
Ch. 0. Mathematical Preliminaries -- Ch. 1. Turing Machines -- Ch. 2. Additional Varieties of Turing Machines -- Ch. 3. An Introduction to Recursion Theory -- Ch. 4. Markov Algorithms -- Ch. 5. Register Machines -- Ch. 6. Post Systems (Optional) -- Ch. 7. The Vector Machine Model of Parallel Computation (Optional) -- Ch. 8. The Bounds of Computability -- Ch. 9. Regular Languages and Finite-State Automata -- Ch. 10. Context-Free Languages and Pushdown-Stack Automata -- Ch. 11. Context-Sensitive Languages and Linear-Bounded Automata -- Ch. 12. Generative Grammars and the Chomsky Hierarchy. |
| Note |
Includes bibliographical references (p. 657-660) and index. |
| Subject |
Computable functions.
|
|
Formal languages.
|
| ISBN |
019510983X (cloth) |
| LC CARD # |
96037454 |
|
