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

**Bayesian Computational Methods**

by

**Christian P. Robert**-

**arXiv**

We will first present the most standard computational challenges met in Bayesian Statistics, focusing primarily on mixture estimation and on model choice issues, and then relate these problems with computational solutions.

(

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

(

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

(

**12885**views)

**An Introduction to the Theory of Computation**

by

**Eitan Gurari**-

**Computer Science Pr**

The book explores questions and terminologies concerning programs, computers, and computation. The exploration reduces to a study of mathematical theories, such as those of automata and formal languages, theories interesting in their own right.

(

**28833**views)