**Introduction to Theory of Computation**

by Anil Maheshwari, Michiel Smid

**Publisher**: Carleton University 2012**Number of pages**: 246

**Description**:

This is a free textbook for an undergraduate course on the Theory of Computation. Contents: Finite Automata and Regular Languages; Context-Free Languages; Turing Machines and the Church-Turing Thesis; Decidable and Undecidable Languages; Complexity Theory.

Download or read it online for free here:

**Download link**

(1.2MB, PDF)

## Similar books

**Rule-based Computation and Deduction**

by

**Helene Kirchner, Pierre-Etienne Moreau**-

**ESSLLI**

This text first introduces the concept of rewriting which is behind rule-based systems. Then the rewriting logic and the rewriting calculus are defined and shown to be especially suited to describing concurrent and non-deterministic computations.

(

**9060**views)

**Cellular Automata And Complexity: Collected Papers**

by

**Stephen Wolfram**-

**Westview Press**

These original papers on cellular automata and complexity provide a highly readable account of what has become a major new field of science, with important implications for computer science, physics, economics, biology, and many other areas.

(

**13965**views)

**Models of Computation: Exploring the Power of Computing**

by

**John E. Savage**-

**Addison-Wesley**

The book re-examines computer science, giving priority to resource tradeoffs and complexity classifications over the structure of machines and their relationships to languages. This viewpoint is motivated by more realistic computational models.

(

**9776**views)

**Galois Connections and Fixed Point Calculus**

by

**Roland Backhouse**

The book on the fundamental algebraic structures in the mathematics of program construction focusing the algebraic properties of recursion and how these are applied to the generic solution of programming problems. The tutorial covers fixed point calculus.

(

**13232**views)