|
Dec 21, 2024
|
|
|
|
COSC 482 - Theory of Computation3 Credit Hours Properties of finite automata/regular sets and push-down automata/context-free languages. Countability, diagonalization, and undecidability. Complexity, including the classes P and NP, NP-completeness, and reduction techniques.
(RE) Prerequisite(s): 312.
Add to Portfolio (opens a new window)
|
|