MAT 4885 - Theory of Computation

(3-0-3) Proof techniques, finite automata, regular expressions and languages, properties of regular languages, context-free grammars and languages, pushdown automata, properties of context-free languages, Turing machines, and undecidability.


Prerequisites & Notes
MAT 2670 and MAT 2345, or permission of instructor.


Credits: 3
Print-Friendly Page (opens a new window)
Close Window