Description: AUTOMATA, FORMAL LANGUAGES, AND COMPUTABILITY
*****
Finite automata, regular expressions, regular languages, pushdown automata, context-free languages, Turing machines, recursive languages, computability, and solvability.
*****
Prerequisite(s): COMP 314.