CS 3252. Theory of Automata, Formal Languages, and Computation. Finite-state machines and regular expressions. Context-free grammars and languages. Pushdown automata. Turing machines. Undecidability. The Chomsky hierarchy. Computational complexity. Prerequisite: CS 2212.