CS 411

Automata Theory

Finite state automata with bounded and unbounded memory. Regular languages and expressions. Context-free languages and grammars. Push-down automata and Turing machines. Undecidable languages. P versus NP problems and NP-completeness. Four hours lecture. Offered every Fall.

Prerequisite: Prerequisite: MATH 201 with a minimum grade of C and MATH 202 with a minimum grade of C;

Course Teachers