THEORY OF COMPUTING

Undergraduate

This course introduces automata theory, formal languages and computability. Topics include: finite automata; regular expressions; regular, context-free, and context-sensitive languages; computability models; algorithmic decidable and undecidable problems. PREREQUISITE: CS 2910, CS 2920 and MATH 2420 Three lecture hours per week