CS 5700 - Computability, Automata, and Formal Languages

3 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., MATH 2150. Graduate students only. Meets with CS 4700.