CSM 4885 - Theory of Computation

Description
CSM 4885. Theory of Computation. (3-0-3) F. 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. Credits: 3 Prerequisites & Notes CSM 2670 and MAT 2345, or permission of instructor.
Credits
3
Attributes
*
Recent Professors
Open Seat Checker
Schedule Planner
Recent Semesters
Fall 2018
Offered
MWF
Avg. Class Size
22
Avg. Sections
1