Memoryless determinacy of parity and mean payoff games: a simple proof
- 1 January 2004
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 310 (1-3) , 365-378
- https://doi.org/10.1016/s0304-3975(03)00427-4
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Tree automata, mu-calculus and determinacyPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Infinite games on finitely coloured graphs with applications to automata on infinite treesTheoretical Computer Science, 1998
- The complexity of mean payoff games on graphsTheoretical Computer Science, 1996
- Infinite games played on finite graphsAnnals of Pure and Applied Logic, 1993
- Cyclic games and an algorithm to find minimax cycle means in directed graphsUSSR Computational Mathematics and Mathematical Physics, 1988
- Automata, tableaux, and temporal logicsPublished by Springer Nature ,1985
- Positional strategies for mean payoff gamesInternational Journal of Game Theory, 1979
- The emptiness problem for automata on infinite treesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1972