Description

Book Synopsis

Part I Preparation.- Chapter 0 Mathematics and Computer Science Basics.- Part II Formal Language Theory and Automata.- Chapter 1 The Regular Languages.- Chapter 2 Non-Regularity.- Chapter 3 The Context-Free Languages.- Chapter 4 The Pushdown Automaton Model.- Part III Undecidability and Turing Machines.- Chapter 5 The Turing Machines.- Chapter 6 Decidable Languages.- Chapter 7 Undecidable Languages.- Part IV Computational Complexity and Resource-Bounded Turing Machine Computation.- Chapter 8 The Time Complexity.- Chapter 9 The Space Complexity.- Chapter 10 The Theory of NP-Completeness.- Chapter 11 Beyond NP-Completeness.- Part V Advanced Topics in Computational Complexity Theory.- Chapter 12 The Probabilistic Polynomial-Time Classes.- Chapter 13 Circuit Complexity and Unambiguity.

An Introduction to Theory of Computation

    Product form

    £64.99

    Includes FREE delivery

    Order before 4pm tomorrow for delivery by Wed 5 Aug 2026.

    A Hardback by Mitsunori Ogihara

      Trusted by thousands of customers. See 2,385+ Customer Reviews

      View other formats and editions of An Introduction to Theory of Computation by Mitsunori Ogihara

      Publisher: Springer
      Publication Date: Publication Date: 7/14/2025
      ISBN13: 9783031847394, 978-3031847394
      ISBN10: 3031847393
      Also in:
      Mathematical theory of computation

      Description

      Book Synopsis

      Part I Preparation.- Chapter 0 Mathematics and Computer Science Basics.- Part II Formal Language Theory and Automata.- Chapter 1 The Regular Languages.- Chapter 2 Non-Regularity.- Chapter 3 The Context-Free Languages.- Chapter 4 The Pushdown Automaton Model.- Part III Undecidability and Turing Machines.- Chapter 5 The Turing Machines.- Chapter 6 Decidable Languages.- Chapter 7 Undecidable Languages.- Part IV Computational Complexity and Resource-Bounded Turing Machine Computation.- Chapter 8 The Time Complexity.- Chapter 9 The Space Complexity.- Chapter 10 The Theory of NP-Completeness.- Chapter 11 Beyond NP-Completeness.- Part V Advanced Topics in Computational Complexity Theory.- Chapter 12 The Probabilistic Polynomial-Time Classes.- Chapter 13 Circuit Complexity and Unambiguity.

      Recently viewed products

      © 2026 Book Curl

        • American Express
        • Apple Pay
        • Diners Club
        • Discover
        • Google Pay
        • Maestro
        • Mastercard
        • PayPal
        • Shop Pay
        • Union Pay
        • Visa

        Login

        Forgot your password?

        Don't have an account yet?
        Create account