Token Games and History-Deterministic Quantitative-Automata

  title={Token Games and History-Deterministic Quantitative-Automata},
  author={Udi Boker and Karoliina Lehtinen},
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, historydeterministic automata are useful in solving games and synthesis problems. Deciding whether a given nondeterministic automaton is historydeterministic (the HDness problem) is generally a difficult task, which might involve an exponential procedure, or even be undecidable, for example for pushdown… 
2 Citations
Between Deterministic and Nondeterministic Quantitative Automata
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.
On the size of good-for-games Rabin automata and its link with the memory in Muller games
It is established that good-for-games Rabin automata that recognise a Muller language are exactly of the same size as the minimal memory required for winning Muller games that have this language as their winning condition, thus proving as a consequence that chromatic memory for winning a Muller game can be exponentially larger than unconstrained memory.


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.
Good for Games Automata: From Nondeterminism to Alternation
It is shown that alternating G FG automata are as expressive as deterministic automata with the same acceptance conditions and indices, and that determinizing Buchi and co-Buchi alternating GFG automata involves a $2^{\Theta(n)}$ state blow-up.
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.
Büchi Good-for-Games Automata Are Efficiently Recognizable
Good-for-Games (GFG) automata offer a compromise between deterministic and nondetermin-istic automata. They can resolve nondeterministic choices in a step-by-step fashion, without needing any
Solving Games Without Determinization
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.
Alternating Weighted Automata
It is shown that alternation brings more expressive power than nondeterminism for limit average and discounted sum, and the expressive power of the various classes of alternating and nondeterministic weighted automata over infinite words is compared.
Quantitative languages
A notion of quantitative simulation that is decidable and implies language inclusion is introduced, and it is shown that most classes of weighted automata cannot be determinized.
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.
On Determinisation of Good-for-Games Automata
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.