Theorem 1: for a guidable automaton A, L(A) is J-feasible iff some bound N makes the parity transduction game T^N_J coincide with the acceptance game of A on every tree.
A modal mu perspective on solving pa rity games in quasi-polynomial time
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
method 1
citation-polarity summary
fields
cs.FL 1years
2024 1verdicts
CONDITIONAL 1roles
method 1polarities
use method 1representative citing papers
citing papers explorer
-
Mostowski Index via extended register games
Theorem 1: for a guidable automaton A, L(A) is J-feasible iff some bound N makes the parity transduction game T^N_J coincide with the acceptance game of A on every tree.