CSCI 672 - Theory of Computation

3 Credits
This course covers the theory of computer science emphasizing automata, grammars computation and their applications in the specification of languages and computer systems, models of computation and complexity. Finite-state machines, pushdown automata, Turing machines, regular expressions, decidability, computational complexity, including classes P, NP, NP-complete, NP-hard, and PSPACE will be explored.