TY  - BOOK
AU  - Wood,Derick
TI  - Theory of computation
SN  - 0471613096
U1  - 004.0151 23
PY  - 1987///
CY  - New York
PB  - John Wiley
KW  - Machine theory.
KW  - Computational complexity.
KW  - Computer science
KW  - Mathematics
N1  - Includes bibliographical references and index; Part I Introduction: 
0. Preliminaries; 
1. Languages and Computation. 
Part II Models: 
2. Finite Automata; 
3. Regular Expressions; 
4. Context-Free Grammars; 
5.Pushdown Automata; 
6. Turing Machines; 
7. Functions, Relations, and Translations. 
Part III Properties: 
8. Family Relationships; 
9. Closure Properties; 
10. Decision Problems. 
Part IV Onward: 
11. Further Topics--
Bibliography--
Index
N2  - This book is designed to be the basis of a one- or two-term introductory course in the theory of computation, concentrating on the fundamental models for languages and computation together with their properties. It contains simple proofs of many results, usually considered difficult
ER  -