3Credit HoursProperties of finite automata/regular sets and push-down automata/context-free languages. Countability, diagonalization, and undecidability. Complexity, including the classes P and NP, NP-completeness, and reduction techniques.
(RE) Prerequisite(s):COSC 312 with a grade of C or better.