|
|
Apr 29, 2024
|
|
CS 411 - Automata Theory Unit(s): 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.
Prerequisite: MATH 201 with a minimum grade of C and MATH 202 with a minimum grade of C College of Arts and Sciences
Add to Portfolio (opens a new window)
|
|
|