This note
describes the following topics: Finite State Machines, Closure and
Nondeterminism, The Pumping Lemma, Minimizing FSMs, Context Free Languages,
CFLs and compilers, Recitation, Pushdown Machines, CFGs and NPDMs, CYK
algorithm, Undecidability and CFLs, Turing Machines, Halting Problem,
Decidability, Complexity Theory, Quantified Boolean Formula, Savitch's
Theorem, Space Hierarchy, Recursion Theorem.

**Author(s):** Wikiversity

NA**Pages**