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