Apress Access

Concise Guide to Computation Theory

By Akira Maruoka

  • eBook Price: $49.99
Buy eBook Buy Print Book

Concise Guide to Computation Theory Cover Image

Combining lucid description and illustrations with rigorous arguments and detailed proofs, this book examines the core concepts of automata and languages, computability, and complexity of computation, and offers a solid foundation in computation theory.

Full Description

  • Add to Wishlist
  • ISBN13: 978-0-8572-9534-7
  • 300 Pages
  • User Level: Students
  • Publication Date: April 29, 2011
  • Available eBook Formats: PDF
Full Description
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.
Table of Contents

Table of Contents

  1. Part I: The Theory of Computation.
  2. Everything Begins With Computation.
  3. Preliminaries to the Theory of Computation.
  4. Part II: Automata and Languages.
  5. Finite Automata.
  6. Context
  7. Free Languages.
  8. Pushdown Automaton.
  9. Part III: Computability.
  10. Turing Machine.
  11. Universality of Turing Machine and its Limitation.
  12. Part IV: Complexity of Computation.
  13. Computational Complexity Based on Turing Machines.
  14. Computational Complexity Based on Boolean Circuits.
  15. NP
  16. Completeness.
  17. Solutions.
  18. Concluding Remarks.

If you think that you've found an error in this book, please let us know by emailing to editorial@apress.com . You will find any confirmed erratum below, so you can check if your concern has already been addressed.
No errata are currently published


    1. Concurrent Programming: Algorithms, Principles, and Foundations


      View Book