An introduction to the most important abstract models of computation and their applications: finite state machines and pushdown automata. Explores the relationship between regular expressions and formal expressions and automata. PREREQUISITE(S): CSC383 and Discrete Math.