CS 410 - Theory of Computation

(3)

This course is an introduction to the topics of formal language theory, computability and automata. Students will learn to use regular expressions and finite automata, will gain exposure to formal grammars and turing machines, and will investigate foundational problems in the theory of computation. Prerequisite(s): CS 102, MS 240