CS420 — Theory of Computation
5 CR This course introduces students to the mathematical foundations of computation and complexity for problem-solving, including the concepts of automata theory, the theory of formal languages and grammars, and the notions of algorithm, decidability, complexity, and computability. Students will develop the ability to understand and conduct mathematical proofs for computation and algorithms in order to solve problems efficiently. Course
Prerequisites: MATH301