|Select the Course Number to get further detail on the course. Select the desired Schedule Type to find available classes for the course.|
|CPSC 340 - Theory of Computation|
This course examines regular expressions, deterministic and non-deterministic finite automata, context-free and other grammars, pushdown automata, Chomsky and Greibach normal forms. Chomsky hierarchy, pumping lemmas, Turing machines, undecidability, computability, recursive function theory, computational complexity, NP-hard and NP-complete problems.
Schedule Types: Lecture, Self-Directed, Final Exam, Lec/Lab/Tut Combination, Laboratory