Introduction to Theory of Computation

Lecture notes

 * COMP 2805 at Carleton University

Lectures

 * Finite State Machines
 * Closure and Nondeterminism
 * The Pumping Lemma
 * Minimizing FSMs
 * Recitation 1
 * Context Free Languages
 * CFLs and compilers
 * Recitation 2
 * Pushdown Machines
 * Recitation 3
 * CFGs and NPDMs
 * More lemmas, CYK algorithm
 * Undecidability and CFLs
 * Recitation 4
 * The Bullseye (Hierarchy of Languages)
 * Turing Machines
 * Recitation 5
 * The Halting Problem
 * Decidability
 * Complexity Theory, Quantified Boolean Formula
 * Savitch's Theorem, Space Hierarchy
 * Decidability/Complexity Relationship, Recursion Theorem

Textbooks
Free textbook:
 * An Introduction to the Theory of Computation , by Eitan Gurari