Automata and Formal Languages (3321)
- Machine-based and grammatical models of computation; finite automata and regular languages, pushdown automata and context-free languages, Turing machines; non-determinism; Church's Thesis. Prereq: 2231 (321), and 2421 (360), and 2331 (Math 566), and Math 3345. Not open to students with credit for 5321 (625). Units: 3 credit hours.
- Computer Science & Engineering (CSE)