CMPSC 138
Automata and Formal Languages
Formal languages; finite automata and regular expressions; properties of regular languages; pushdown automata and context-free grammars; properties of context-free languages; introduction to Turing machines and computability.
Sources
- Course catalogue ↗2026-2027