Automata, Formal Languages, and Computability

Undergraduate

Automata theory, formal languages, computability and complexity, including the Chomsky hierarchy for languages, decision problems for languages, theoretical computability, non-computable functions and related problems. Prerequisite(s): COMP 2113, MATH 1413 or MATH 1313, MATH 1323 or MATH 1333, each with a minimum grade of C-.