CSE 322 Introduction to Formal Models in Computer
Science (3)
Finite automata and regular expressions; context-free grammars and pushdown
automata; nondeterminism; Turing machines and the halting problem. Emphasis on
understanding models and their applications and on rigorous use of basic
techniques of analysis. Induction proofs, simulation, diagonalization, and
reduction arguments. Prerequisite: CSE 321.