Apr 16, 2024  
2009-2010 Undergraduate Catalog 
    
2009-2010 Undergraduate Catalog [ARCHIVED CATALOG]

Add to Portfolio (opens a new window)

COSC 380 - Theory of Computation

3 Credit Hours
Countability and diagonalization. Finite automata and regular sets. Push-down automata and context-free languages. Introduction to Turing machines and undecidability.

(RE) Prerequisite(s): 311.



Add to Portfolio (opens a new window)