2011

Concise Guide to Computation Theory

Authors:

ISBN: 978-0-85729-534-7 (Print) 978-0-85729-535-4 (Online)

Table of contents (12 chapters)

  1. Front Matter

    Pages I-XVII

  2. The Theory of Computation

    1. Front Matter

      Pages 1-1

    2. No Access

      Book Chapter

      Pages 3-11

      Everything Begins with Computation

    3. No Access

      Book Chapter

      Pages 13-32

      Preliminaries to the Theory of Computation

  3. Automata and Languages

    1. Front Matter

      Pages 33-33

    2. No Access

      Book Chapter

      Pages 35-80

      Finite Automata

    3. No Access

      Book Chapter

      Pages 81-106

      Context-Free Languages

    4. No Access

      Book Chapter

      Pages 107-130

      Pushdown Automata

  4. Computability

    1. Front Matter

      Pages 131-131

    2. No Access

      Book Chapter

      Pages 133-159

      Turing Machine

    3. No Access

      Book Chapter

      Pages 161-181

      Universality of Turing Machine and Its Limitations

  5. Complexity of Computation

    1. Front Matter

      Pages 183-183

    2. No Access

      Book Chapter

      Pages 185-199

      Computational Complexity Based on Turing Machines

    3. No Access

      Book Chapter

      Pages 201-225

      Computational Complexity Based on Boolean Circuits

    4. No Access

      Book Chapter

      Pages 227-238

      NP-Completeness

  6. Conclusions and Exercise Solutions

    1. Front Matter

      Pages 239-239

    2. No Access

      Book Chapter

      Pages 241-270

      Solutions

    3. No Access

      Book Chapter

      Pages 271-272

      Concluding Remarks

  7. Back Matter

    Pages 273-281