CS3531 — Automata and Formal Languages
Introduction to the theory of computation. Deterministic and nondeterministic finite automata, regular languages and regular expressions. Kleene's Theorem. Context-free languages, context-free grammars and pushdown automata. Turning Machines and computability. pre-req: CS 2531 or MATH 3355; or instructor consent, a grade of C- or better is required in all prerequisite courses