|
|
Oct 31, 2024
|
|
CS 5700 - Computability, Automata, and Formal Languages3 Credits (Minimum) 3 Credits (Maximum)
Finite automata and regular expressions; context-free grammars, context-free languages, and pushdown automata; Turing machines; undecidability; the Chomsky Hierarchy of Formal Languages; computational complexity, and intractable problems. Prer., CS 2150 or MATH 2150. College of Engineering Graduate Students only. Meets with CS 4700.
Add to Portfolio (opens a new window)
|
|
|