A study of formal models of computation such as finite state automata, push-down automata, context-free grammars, and Turing machines, along with the corresponding elements of formal languages. Other topics include computability, complexity, and NP-completeness.

Prerequisite: (COSC 240 with a minimum grade of D or MATH 260 with a minimum grade of D) and COSC 350 with a minimum grade of C.