Good-for-games ω-Pushdown Automata

@article{Lehtinen2020GoodforgamesA,
  title={Good-for-games $\omega$-Pushdown Automata},
  author={Karoliina Lehtinen and Martin Zimmermann},
  journal={Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science},
  year={2020}
}
  • K. Lehtinen, Martin Zimmermann
  • Published 13 January 2020
  • Computer Science
  • Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science
We introduce good-for-games ω-pushdown automata (ω-GFG-PDA). These are automata whose nondeterminism can be resolved based on the run constructed thus far. Good-for-gameness enables automata to be composed with games, trees, and other automata, applications which otherwise require deterministic automata. Our main results are that ω-GFG-PDA are more expressive than deterministic ω-pushdown automata and that solving infinite games with winning conditions specified by ω-GFG-PDA is EXPTIME-complete… 

Figures and Tables from this paper

Good-for-games ω-Pushdown Automata
TLDR
These are automata whose nondeterminism can be resolved based on the input processed so far and it is shown that solving infinite games with winning conditions specified by $\omega$-GFG-PDA is EXPTIME-complete and that the universality problem for the automata is in EXPTime as well.
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,
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.
Canonicity in GFG and Transition-Based Automata
TLDR
Limiting attention to the safe components is useful, and implies that the only minimal tDCWs that have no canonical form are these for which the transition to the GFG model results in strictly smaller automaton, which do have a canonical minimal form.
A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct
TLDR
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 (I/O)-Aware Good-For-Games Automata
TLDR
(I/O)-aware GFG automata are unboundedly more succinct than deterministic and even GFG automation, using them circumvents determinization, and their study leads to new and interesting insights about hostile vs. collaborative nondeterminism, as well as the theoretical bound for realizing systems.
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.
On the size of good-for-games Rabin automata and its link with the memory in Muller games
TLDR
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.
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.

References

SHOWING 1-10 OF 37 REFERENCES
Good-for-games ω-Pushdown Automata
TLDR
These are automata whose nondeterminism can be resolved based on the input processed so far and it is shown that solving infinite games with winning conditions specified by $\omega$-GFG-PDA is EXPTIME-complete and that the universality problem for the automata 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
Good for Games Automata: From Nondeterminism to Alternation
TLDR
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.
Regularity Problems for Weak Pushdown ω-Automata and Games
We show that the regularity and equivalence problems are decidable for deterministic weak pushdown ω-automata, giving a partial answer to a question raised by Cohen and Gold in 1978. We prove the
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.
Logic for ω-pushdown automata
Decision procedures for families of deterministic pushdown automata
TLDR
It is shown that such questions as whether a deterministic context-free language can be recognised by a machine in any one of the above named classes, must be, if decidable at all, at least as difficult to decide as whether such a language is regular.
Simplification Problems for Deterministic Pushdown Automata on Infinite Words
TLDR
Some decidability results concerning simplification problems for DPDAs on infinite words (ω-DPDAs) are surveyed and some insights are given on the equivalence problem for a subclass of ω-DPDA.
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.
On Büchi One-Counter Automata
TLDR
The first result shows that decidability no longer holds when moving from finite words to infinite words and proves that already the equivalence problem for deterministic Buchi one-counter automata is undecidable.
...
...