CS 411 - Automata and Computation

Units: 3
Formal models of computation, languages and computability, deterministic and non-deterministic finite automata, regular expressions, pushdown automata, context-free languages, Pumping Lemmas, Turing machines, decidability, reducibility, and undecidable problems.

Prerequisites: CS 211 and MATH 225, both with grade C- or better.
Equivalent Quarter Course: CS 4170.
Possible Instructional Methods: Entirely On-ground, Entirely On-line, Hybrid (every section of this course may be taught both online and on-ground).
Grading: A-F grading only.