15-453 Formal Languages, Automata, and Computability

9 units, Carnegie Mellon University

An introduction to the fundamental ideas and models underlying computing finite automata, regular sets, pushdown automata, contextfree grammars, Turing machines, undecidability, and complexity theory.

Prerequisites: 21-228 (min C) or 15-251 (min C)

Courseweave needs JavaScript to show sections, workloads and planning tools.