CS 350 Automata/Formal Lang theory
| Old Content |
This page was recently redesigned. To access this course's old homepage, please
click here. |
| Description |
Finite-state automata and regular expressions, context-free grammars and pushdown automata, Turing machines, computability and decidability, and complexity classes. |
| Credit Hours |
3.000 |
| Type |
Lecture |
| Prerequisites |
Undergraduate level CS 250 Minimum Grade of C and Undergraduate level CS 302 Minimum Grade of C and Undergraduate level MA 125 Minimum Grade of C |
| Files |
|
|
