Prerequisite: CECS 328 with a grade of “C” or better. Fundamental topics in theoretical computer science. Topics include regular languages, finite automata, context-free languages. Turing machine, computability theory, computational complexity, NP-completeness.
Letter grade only (A-F). (Lecture-problems 3 hours)