Pub. Date:
Springer London
Concise Guide to Computation Theory

Concise Guide to Computation Theory

by Akira Maruoka


Current price is , Original price is $69.95. You

Temporarily Out of Stock Online

Please check back later for updated availability.


This textbook presents a thorough foundation to the theory of computation. Combining intuitive descriptions and illustrations with rigorous arguments and detailed proofs for key topics, the logically structured discussion guides the reader through the core concepts of automata and languages, computability, and complexity of computation. Topics and features: presents a detailed introduction to the theory of computation, complete with concise explanations of the mathematical prerequisites; provides end-of-chapter problems with solutions, in addition to chapter-opening summaries and numerous examples and definitions throughout the text; draws upon the author’s extensive teaching experience and broad research interests; discusses finite automata, context-free languages, and pushdown automata; examines the concept, universality and limitations of the Turing machine; investigates computational complexity based on Turing machines and Boolean circuits, as well as the notion of NP-completeness.

Product Details

ISBN-13: 9781447158165
Publisher: Springer London
Publication date: 08/29/2014
Edition description: 2011
Pages: 281
Product dimensions: 6.10(w) x 9.25(h) x 0.02(d)

Table of Contents

Part I: The Theory of Computation

Everything Begins With Computation

Preliminaries to the Theory of Computation

Part II: Automata and Languages

Finite Automata

Context-Free Languages

Pushdown Automaton

Part III: Computability

Turing Machine

Universality of Turing Machine and its Limitation

Part IV: Complexity of Computation

Computational Complexity Based on Turing Machines

Computational Complexity Based on Boolean Circuits



Concluding Remarks

Customer Reviews

Most Helpful Customer Reviews

See All Customer Reviews