|
Oct 04, 2024
|
|
|
|
Graduate Record 2015-2016 [ARCHIVED RECORD]
|
CS 6160 - 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. Prerequisite: CS 3102 or equivalent.
Credits: 3
|
|