Prerequisite: Open to Computer Engineering MS, Computer Science MS and Engineering MS students only. Finite Automata and regular expressions. Pushdown automata and context-free languages. Turing machines and computability. Computational complexity. Additional projects required for CECS 519.
Letter grade only (A-F). (Lecture-problems 3 hours). Double Numbered with: CECS 419
