CS 411 - Automata Theory (4)
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. Prerequisites: MATH 201 (grade of C or better) and MATH 202 (grade of C or better).