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.
Possible Instructional Methods: Entirely On-ground, or Entirely Online, or Hybrid.
Grading: A-F grading only.
Course Typically Offered: Fall & Spring

Student Learning Outcomes - Upon successful completion of this course students will be able to:

Generate regular expressions (REs), regular grammars, or context-free grammars (CFGs) to represent specified languages;
Define and build formal models of computation such as deterministic finite Automata (DFAs), nondeterministic finite automata (NFAs), pushdown automata (PDAs), and Turing machines;
Convert a problem to an equivalent formal representation;
Develop proofs to statements regarding the computability of problems.