105

Maruoka, Akira

Akira Maruoka

London New York : Springer

, 2011.

xvii, 281 p. : ill. ; 24 cm

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.

index

Includes bibliographical references (p. 275-276)

QA

267.7

.M378

2011

978-0-85729-534-7