(CS 320) Introduction to Computational Theory
Finite state automata and regular expressions, context-free grammars and pushdown automata, turing machines, computability, and undecidability.
| Credit Hours | 3.0 Lecture |
|---|---|
| Prerequisites | CS 203 and CIS 206 |
| Offered | Winter |
| Programs | - |
Course Outcomes:
Forthcoming