2015-2016 Undergraduate Catalog 
    
    Nov 13, 2018  
2015-2016 Undergraduate Catalog [ARCHIVED CATALOG]

[Add to Portfolio]

COSC 482 - Theory of Computation

3 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]