everything.study
CMPSC 138

Automata and Formal Languages

4-None

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