Minimization and Canonization of GFG Transition-Based Automata
While many applications of automata in formal methods can use nondeterministic automata, some applications, most notably synthesis, need deterministic or good-for-games (GFG) automata.The latter are nondeterministic automata that can resolve their nondeterministic choices in a way that only depends on the past.The minimization problem for determini