|
|
May 12, 2024
|
|
C S 570 - Computability, Automata, and Formal Languages3 Credits
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.Prerequisites: MATH 215 and MATH 313 Meets with C S 470
Add to Portfolio (opens a new window)
|
|
|