Reviews regular expressions and finite automata. Studies Turing machines and equivalent models of computation, the Chomsky hierarchy, context-free grammars, push-down automata, and computability. Prerequisites: Restricted to graduate students or Computer Science Concurrent Degree (CSEN) majors only.
