Course Catalog

Course Detail

CPSC 351 Theory of Computation
3.00 credits
Study of automata, languages, and computability theory. Regular grammars, finite state automata, context-free grammars, pushdown automata, Turing machines, decidable and undecidable problems, and problem reduction. Fall, odd years.