**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

**Languages and Machines**

by

**C. D. H. Cooper**-

**Macquarie University**

This is a text on discrete mathematics. It includes chapters on logic, set theory and strings and languages. There are some chapters on finite-state machines, some chapters on Turing machines and computability, and a couple of chapters on codes.

(

**12774**views)

**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.

(

**3929**views)

**Logic and Proof**

by

**Lawrence C Paulson**-

**University of Cambridge**

These lecture notes give a brief introduction to logic, with including the resolution method of theorem-proving and its relation to the programming language Prolog. Formal logic is used for specifying and verifying computer systems.

(

**7841**views)

**Introduction to Computing: Explorations in Language, Logic, and Machines**

by

**David Evans**-

**University of Virginia**

An introduction to the most important ideas in computing. It focuses on how to describe information processes by defining procedures, how to analyze the costs required to carry out a procedure, and the limits of what can be computed mechanically.

(

**8674**views)