Catalog Entries |
Fall 2021 - 1st Sem 2021-22
Apr 25, 2024 |
|
 |
||
 | Select the Course Number to get further detail on the course. Select the desired Schedule Type to find available classes for the course. |
| C S 515 - THEORY OF COMPUTATION |
|
Finite automata theory, including determinism vs. nondeterminism, regular expressions, nonregular languages, and algorithms for finite automata. Context free languages including grammars, parsing, and properties. Turing machines and their functions. Undecidability. Computational complexity, including the classes P and NP.
|
|