Detailed Course Information |
Fall 2021 - 1st Sem 2021-22
May 05, 2024 |
|
 |
||
 | Select the desired Level or 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.
Restrictions: May not be enrolled in one of the following Levels: Undergraduate Level Prerequisites: Undergraduate Level level C S 415 |
| Return to Previous | New Search |
|