COSC 301 Automata, Computability, and Complexity
This course is about fundamental ideas in the theory of computation, including formal languages, computability, and complexity. In this course, students gain proficiency in the concepts of automata, formal languages, grammar, algorithms, computability, decidability, and complexity.
Distribution
(2,2,3)Offered
Fall Spring Summer