CS 310 Automata and Formal Languages

Course Credit: 1

Abstract models of computation, including finite state automata, pushdown automata, Turing machines and their relationship to formal languages and grammars. Introduction to computational complexity and NP-complete problems.

Prerequisite(s): CS 220.