TY  - BOOK
AU  - Maruoka, Akira
TI  - Concise guide to computation theory
SN  - 9780857295347
AV  - QA 267.7 Mar 
PY  - 2011///
CY  - London
PB  - Springer
KW  - COMPUTATIONAL COMPLEXITY
KW  - COMPUTABLE FUNCTIONS
KW  - MACHINE THEORY
N1  - Includes bibliographical references (p. 275-276) and index; Part I. The theory of computation -- 1. Everything begins with computation -- 2. Preliminaries to the theory of computation -- Part II. Automata and languages -- 3. Finite automata -- 4. Context-free languages -- 5. Pushdown automata -- Part III. Computability -- 6. Turing machine -- 7. Universality of Turing machine and its limitations -- Part IV. Complexity of computation -- 8. Computational complexity based on Turing machines -- 9. Computational complexity based on Boolean circuits -- 10. NP-completeness -- Part V. Conclusions and exercise solutions --11.  Solutions -- 12. Concluding remarks
ER  -