**An Introduction to the Theory of Computation**

by Eitan Gurari

**Publisher**: Computer Science Pr 1989**ISBN/ASIN**: 0716781824**ISBN-13**: 9780716781820**Number of pages**: 600

**Description**:

This book explores some of the more important terminologies and questions concerning programs, computers, problems, and computation. The exploration reduces in many cases to a study of mathematical theories, such as those of automata and formal languages; theories that are interesting also in their own right. These theories provide abstract models that are easier to explore, because their formalisms avoid irrelevant details.

Download or read it online for free here:

**Download link**

(6.4MB, PDF)

## Similar books

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

(

**7856**views)

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

(

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

(

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

(

**4104**views)