Description

Book Synopsis
This text strikes a good balance between rigor and an intuitive approach to computer theory. Covers all the topics needed by computer scientists with a sometimes humorous approach that reviewers found "refreshing". It is easy to read and the coverage of mathematics is fairly simple so readers do not have to worry about proving theorems.

Table of Contents
AUTOMATA THEORY.

Background.

Languages.

Recursive Definitions.

Regular Expressions.

Finite Automata.

Transition Graphs.

Kleene's Theorem.

Finite Automata with Output.

Regular Languages.

Nonregular Languages.

Decidability.

PUSHDOWN AUTOMATA THEORY.

Context-Free Grammars.

Grammatical Format.

Pushdown Automata.

CFG = PDA.

Non-Context-Free Languages.

Context-Free Languages.

Decidability.

TURING THEORY.

Turing Machines.

Post Machines.

Minsky's Theorem.

Variations on the TM.

TM Languages.

The Chomsky Hierarchy.

Computers.

Bibliography.

Indexes.

Intro to Computer Theory 2e

    Product form

    £218.66

    Includes FREE delivery

    RRP £242.95 – you save £24.29 (9%)

    Order before 4pm today for delivery by Fri 19 Jun 2026.

    A Paperback / softback by Daniel I. A. Cohen


      View other formats and editions of Intro to Computer Theory 2e by Daniel I. A. Cohen

      Publisher: John Wiley & Sons Inc
      Publication Date: 27/11/1996
      ISBN13: 9780471137726, 978-0471137726
      ISBN10: 0471137723
      Also in:
      Computer science

      Description

      Book Synopsis
      This text strikes a good balance between rigor and an intuitive approach to computer theory. Covers all the topics needed by computer scientists with a sometimes humorous approach that reviewers found "refreshing". It is easy to read and the coverage of mathematics is fairly simple so readers do not have to worry about proving theorems.

      Table of Contents
      AUTOMATA THEORY.

      Background.

      Languages.

      Recursive Definitions.

      Regular Expressions.

      Finite Automata.

      Transition Graphs.

      Kleene's Theorem.

      Finite Automata with Output.

      Regular Languages.

      Nonregular Languages.

      Decidability.

      PUSHDOWN AUTOMATA THEORY.

      Context-Free Grammars.

      Grammatical Format.

      Pushdown Automata.

      CFG = PDA.

      Non-Context-Free Languages.

      Context-Free Languages.

      Decidability.

      TURING THEORY.

      Turing Machines.

      Post Machines.

      Minsky's Theorem.

      Variations on the TM.

      TM Languages.

      The Chomsky Hierarchy.

      Computers.

      Bibliography.

      Indexes.

      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