Formal languages and automata theory, with an introduction to computability. Course coverage includes deterministic and nondeterministic automata, pushdown automata, regular and context-free languages and grammars, models of computation including the Turing machine, computability, decidability, and the Halting problem. Prerequisite: CMP 101
Prerequisite Courses