COT 5420 - Theory of Computation I (3)
Description: Mathematical models of computation; regular, context-free, recursive, and recursively enumerable languages; equivalence of models; techniques for proving non-membership of a language in a class: pumping lemmas, diagonalization, reductions.
Prerequistes: MAD 3512 - Theory of Algorithms
Notes: Course offered every Fall semester