Generalizes GFG properties to alternating automata, proves equivalence of definitions, shows expressiveness equals deterministic automata, and bounds determinization blow-up for weak acceptance conditions.
Good for games automata: From nondeterminism to alternation
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.FL 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Good for Games Automata: From Nondeterminism to Alternation
Generalizes GFG properties to alternating automata, proves equivalence of definitions, shows expressiveness equals deterministic automata, and bounds determinization blow-up for weak acceptance conditions.