Skip to main content
Book cover

Concise Guide to Computation Theory

  • Textbook
  • © 2011

Overview

  • 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
  • Includes supplementary material: sn.pub/extras

This is a preview of subscription content, log in via an institution to check access.

Access this book

eBook USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book USD 54.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (12 chapters)

  1. The Theory of Computation

  2. Automata and Languages

  3. Computability

  4. Complexity of Computation

  5. Conclusions and Exercise Solutions

About this book

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.

Reviews

From the reviews:

“This work could certainly serve as a text for an undergraduate computer science course, and it might also be considered for presenting these essential modern ideas to students in other majors. … well-thought-out diagrams highlight important concepts and help elucidate proofs. An ideal text for a one-term course introducing computation theory to either majors or nonmajors; also appropriate for undergraduate self-study. Summing Up: Highly recommended. Upper-division undergraduates through professionals.”­­­ (P. Cull, Choice, Vol. 49 (3), November, 2011)

“The author walks a delicate path between presenting the breadth of topics and exploring all the depths of the theory, between writing a comprehensive (encyclopedic) textbook and providing a concise overview of the essential topics. … a concise introduction to the theory of computation, concentrating on the fundamental results that have the greatest impact on the theory and its practical applications. … very appropriate for graduate students in computer science or those academics who want a refresher course on the main results of the discipline.” (R. Goldberg, ACM Computing Reviews, March, 2012)

Authors and Affiliations

  • Faculty of Science and Engineering, Ishinomaki Senshu University, Ishinomaki, Japan

    Akira Maruoka

Bibliographic Information

  • Book Title: Concise Guide to Computation Theory

  • Authors: Akira Maruoka

  • DOI: https://doi.org/10.1007/978-0-85729-535-4

  • Publisher: Springer London

  • eBook Packages: Computer Science, Computer Science (R0)

  • Copyright Information: Springer-Verlag London Limited 2011

  • Hardcover ISBN: 978-0-85729-534-7Published: 06 May 2011

  • Softcover ISBN: 978-1-4471-5816-5Published: 29 August 2014

  • eBook ISBN: 978-0-85729-535-4Published: 29 April 2011

  • Edition Number: 1

  • Number of Pages: XVII, 281

  • Topics: Theory of Computation, Computational Science and Engineering

Publish with us