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 Deductionby 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.
(10731 views)
Languages and Machinesby 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.
(23865 views)
An Introduction to the Theory of Computationby 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.
(31871 views)
Galois Connections and Fixed Point Calculusby 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.
(15140 views)