Good for Games Automata: From Nondeterminism to Alternation

@article{Boker2019GoodFG,
  title={Good for Games Automata: From Nondeterminism to Alternation},
  author={Udi Boker and Karoliina Lehtinen},
  journal={ArXiv},
  year={2019},
  volume={abs/1906.11624}
}
A word automaton recognizing a language $L$ is good for games (GFG) if its composition with any game with winning condition $L$ preserves the game's winner. While all deterministic automata are GFG, some nondeterministic automata are not. There are various other properties that are used in the literature for defining that a nondeterministic automaton is GFG, including "history-deterministic", "compliant with some letter game", "good for trees", and "good for composition with other automata… 

Figures from this paper

On Succinctness and Recognisability of Alternating Good-for-Games Automata
TLDR
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.
Minimization and Canonization of GFG Transition-Based Automata
TLDR
The minimization algorithm is described and used to show canonicity for transition-based GFG co-B¨uchi word automata: all minimal automata have isomorphic safe components and once the authors saturate the automata with α -transitions, they get full isomorphism.
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,
History Determinism vs. Good for Gameness in Quantitative Automata
TLDR
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.
Good-for-games ω-Pushdown Automata
TLDR
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.
On the Succinctness of Alternating Parity Good-for-Games Automata
TLDR
This work presents a single exponential determinisation procedure and an Exptime upper bound to the problem of recognising whether an alternating automaton is GFG, and studies the complexity of deciding "half-GFGness", a property specific to alternating automata that only requires nondeterministic choices to be resolved in an online manner.
A Hierarchy of Nondeterminism
TLDR
It is shown that the hierarchy is strict, the expressive power of the different levels in it is studied, as well as the complexity of deciding the membership of a language in a given level, which relates the level of nondeterminism with the probability that a random run on a word in the language is accepting.
Minimising Good-for-Games automata is NP complete
TLDR
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.
Between Deterministic and Nondeterministic Quantitative Automata
TLDR
The possible generalization of such notions from Boolean to quantitative automata is analyzed, and it is suggested that it depends on the following key characteristics of the considered notion N– whether it is syntactic or semantic, and if semantic,Whether it is word-based or language-based.
Register Games
TLDR
A translation of alternating parity word automata into alternating weak automata with only a quasi-polynomial increase in size is presented, based on register games; this improves on the previous exponential translation.
...
...

References

SHOWING 1-10 OF 31 REFERENCES
How Deterministic are Good-For-Games Automata?
TLDR
GFG automata enjoy the benefits of typeness, similarly to the case of deterministic automata, and are shown to be exponentially more succinct than deterministic ones.
Relating word and tree automata
TLDR
This work relates the expressiveness gap between deterministic and nondeterministic Buchi word automata and the expressivity gap between Buchi and Rabin tree automata, and provides an exponential determinization of Buchi tree Automata that recognize derived languages.
Solving Games Without Determinization
TLDR
The main insight is that a nondeterministic automaton is good for solving games if it fairly simulates the equivalent deterministicAutomata are constructed that omit the determinization step in game solving and reactive synthesis.
On the Way to Alternating Weak Automata
TLDR
It is shown that Alternating parity word automata can be turned into alternating weak automata of quasi-polynomial (rather than exponential) size, which corresponds to a weak version of the canonical game languages known to be strict for the Mostowski - Rabin index hierarchy.
On Determinisation of Good-for-Games Automata
TLDR
The main results of this work answer the question whether parity GFG automata actually present an improvement in terms of state-complexity the number of states compared to the deterministic ones.
Alternation Removal in Büchi Automata
TLDR
It is shown that the breakpoint construction captures the accurate essence of alternation removal, and a matching Ω(3n) lower bound is provided for universal (rather than alternating) automata with an alphabet of a constant size.
Nondeterminism in the Presence of a Diverse or Unknown Future
TLDR
It is shown that GFT=GFG⊃DBP, and described a determinization construction for GFG automata, which shows the possible succinctness of GFG and GFT automata compared to deterministic automata.
Why These Automata Types?
TLDR
This work shows that unifying or intersecting deterministic automata of the classic ω-regularcomplete types, namely parity, Rabin, Streett, and Muller, involves an exponential size blowup, and argues that there are good reasons for the classic types, mainly in the case of nondeterministic and alternating automata.
Forms of Determinism for Automata
TLDR
Some variants of the notion of determinism are surveyed, refining the spectrum between non-determinism and determinism, and various notions for finite words, infinite words, finite trees, infinite trees, data languages, and cost functions are instantiated.
Alternating Weak Automata from Universal Trees
TLDR
An improved translation from alternating parity automata on infinite words to alternating weak automata is given and would yield a significant breakthrough in algorithms for solving parity games that are asymptotically faster in the worst case than the current state of the art.
...
...