Formal grammars, finite-state machines, equivalence of machines, reduction, finite-state languages, acceptors, regular expressions, pushdown automata, context-free languages, Turing machines, computability.
Prerequisite: CSci 131, CSci 135.
Syllabus