Prerequisite: CECS 328 with a grade of “C” or better. Finite Automata and regular expressions. Pushdown automata and context-free languages. Turing machines and computability. Computational complexity.
Letter grade only (A-F). Additional projects required for CECS 519. (Lecture-problems 3 hours) CECS 419