On the size of good-for-games Rabin automata and its link with the memory in Muller games

  title={On the size of good-for-games Rabin automata and its link with the memory in Muller games},
  author={Antonio Casares and Thomas Colcombet and Karoliina Lehtinen},
In this paper, we look at good-for-games Rabin automata that recognise a Muller language (a language that is entirely characterised by the set of letters that appear infinitely often in each word). We establish that minimal such automata are exactly of the same size as the minimal memory required for winning Muller games that have this language as their winning condition. We show how to effectively construct such minimal automata. Finally, we establish that these automata can be exponentially… 

Figures from this paper

Infinite Separation between General and Chromatic Memory
In this note, we answer a question from [Alexander Kozachinskiy. State Complexity of Chromatic Memory in Infinite-Duration Games, arXiv:2201.09297]. Namely, we construct a winning condition W over a
Half-Positional Objectives Recognized by Deterministic Büchi Automata
This paper characterize objectives recognizable by deterministic Büchi automata (a class of ω -regular objectives) that are half-positional, in both finite and infinite graphs, using the language-theoretic notion of right congruence.


State Complexity of Chromatic Memory in Infinite-Duration Games
This paper investigates a restricted class of finite- memory strategies called chromatic finite-memory strategies, and shows that if this game graph has a winning strategy with q states of general memory, then it also has a Winning strategy with (q + 1)n states of chromatic memory, and that this bound is almost tight.
History Determinism vs. Good for Gameness in Quantitative Automata
It is shown that good-for-games automata are central for “global” (classical) synthesis, while “local’ (good-enough) synthesis reduces to deciding whether a nondeterministic automaton is history deterministic.
Token Games and History-Deterministic Quantitative-Automata
A nondeterministic automaton is history-deterministic if its nondeterminism can be resolved by only considering the prefix of the word read so far. Due to their good compositional properties,
Characterizing Omega-Regularity through Finite-Memory Determinacy of Games on Infinite Graphs
A reciprocal of that statement: when both players can play optimally with a chromatic finite-memory structure (i.e., whose updates can only observe colors) in all infinite game graphs, then the objective must be ω -regular, and this provides a game-theoretic characterization of ω-regular objectives.
Optimal Transformations of Games and Automata Using Muller Conditions
A new transformation is defined called the alternating cycle decomposition, inspired and extending Zielonka’s construction, which operates on transition systems, encompassing both automata and games, and preserves semantic properties through the existence of a locally bijective morphism.
On the Minimisation of Transition-Based Rabin Automata and the Chromatic Memory Requirements of Muller Conditions
It is deduced that finding the chromatic memory requirements of a Muller condition is NP -complete, and it is proved that chromatic memories cannot be optimal in general, disproving a conjecture by Kopczyński.
A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct
It is proved that GFG-PDA recognise more languages than deterministic PDA (DPDA) but not all context-free languages (CFL) and this class is orthogonal to unambiguous CFL.
Minimising Good-for-Games automata is NP complete
It is shown for the standard state based acceptance that the minimality of a GFG automaton is NP-complete for Buchi, Co-Buchi, and parity G FG automata, a surprisingly straight forward generalisation of the proofs from deterministic Buchi automata.
On Succinctness and Recognisability of Alternating Good-for-Games Automata
The complexity of deciding "half-GFGness", a property specific to alternating automata that only requires nondeterministic choices to be resolved in an online manner, is studied, and it is shown that this problem is strictly more difficult than GFGness check.
Good-for-games ω-Pushdown Automata
These are automata whose nondeterminism can be resolved based on the run constructed thus far and it follows that the universality problem for ω-GFG-PDA is in EXPTIME as well.