6 citations · 18 across the 8 of their papers we have counts for
Showing 2017 · cs.FLShow all
2 papers · 2 filters
cs.FL2017
How Deterministic are Good-For-Games Automata?
Udi Boker, Orna Kupferman, Michał Skrzypczak
In GFG automata, it is possible to resolve nondeterminism in a way that only depends on the past and still accepts all the words in the language. The motivation for GFG automata co…
cs.FL2017★ 1 cited
Trading Bounds for Memory in Games with Counters
Nathanaël Fijalkow, Florian Horn, Denis Kuperberg +1
We study two-player games with counters, where the objective of the first player is that the counter values remain bounded. We investigate the existence of a trade-off between the…