Formal Languages, Automata, and Computability

9 units · Undergraduate

Intermittent: 9 units An introduction to the fundamental ideas and models underlying computing: finite automata, regular sets, pushdown automata, context-free grammars, Turing machines, undecidability, and complexity theory. Prerequisites: 15-251 Min. grade C or 21-228 Min. grade C