Prefix-independent Σ₀² objectives with neutral letters are positional over arbitrary graphs exactly when recognized by history-deterministic monotone co-Büchi automata over countable ordinals, with proofs for mean-payoff positionality and a completeness lifting from finite graphs.
How deterministic are good-for-games automata? In FSTTCS, volume 93 ofLIPIcs, pages 18:1–18:14
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LO 1years
2023 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Positionality in $\Sigma_0^2$ and a completeness result
Prefix-independent Σ₀² objectives with neutral letters are positional over arbitrary graphs exactly when recognized by history-deterministic monotone co-Büchi automata over countable ordinals, with proofs for mean-payoff positionality and a completeness lifting from finite graphs.