Oct 20, 2019  
Graduate Record 2007-2008 
    
Graduate Record 2007-2008 [ARCHIVED RECORD]

CS 660 - Theory of Computation


Analyzes formal languages, the Chomsky hierarchy, formal computation and machine models, finite automata, pushdown automata, Turing machines, Church’s thesis, reductions, decidability and undecidability, and NP-completeness. (Y)

Prerequisites & Notes
Prerequisite: CS 302 or equivalent.

Credits: 3