|
|
Nov 27, 2024
|
|
CS 4700 - Computability, Automata and Formal Languages3 Credits (Minimum) 3 Credits (Maximum)
Finite automata and regular expressions, context-free grammars, context-free languages, and pushdown automata, Turning machines, undecidability, the Chomsky hierarchy of formal languages, computational complexity and intractable problems. Prer., MATH 2150, MATH 3130; Engineering majors only. Meets with CS 5700.
Add to Portfolio (opens a new window)
|
|
|