Semester Hours:3Periodically
Languages, the grammars that generate them, and the machines that accept them; regular languages; finite automata – deterministic and nondeterministic; transition functions and state diagrams; context-free languages and pushdown automata; context-free grammars and compiler design; context-sensitive languages and linear-bounded automata; closure results.
Prerequisite(s)/Course Notes: Course open to graduate students in computer science, others need permission from computer science graduate director.