15-454 Special Topic: Computational Automata Theory

9 units, Carnegie Mellon University

Large parts of automata theory are algorithmic in nature. In this course we will take a close look at some of the more advanced algorithms such as Hopcroft's minimization, Safra's determinization and Pin's D-class decomposition. Whenwever appropriate, we will consider ordinary word automata, omega-automata and zeta-automata. As an application we study the analysis (model checking) of automatic structures in algebra and discrete dynamics.

Prerequisites: 15-453 or 15-354

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