Finite Automata § Finite Automata Regular Expressions Regular Grammar Regular Languages Pushdown Autotmata § Pushdown Automata Context-Free Grammar Context-Free Language Turing Machines § Turing Machine Recursively Enumerable Languages Unrestricted Grammar Background Knowledge § Formal Grammar, Formal Languages Chompsky Heirarchy Greibach Normal Form, Chompsky Normal Form