STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Infinite games on finitely coloured graphs with applications to automata on infinite trees
Theoretical Computer Science
The Complexity of Tree Automata and Logics of Programs
SIAM Journal on Computing
How much memory is needed to win infinite games?
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Automata logics, and infinite games: a guide to current research
Automata logics, and infinite games: a guide to current research
Specify, Compile, Run: Hardware from PSL
Electronic Notes in Theoretical Computer Science (ENTCS)
Lower bounds for processing data with few random accesses to external memory
Journal of the ACM (JACM)
Memory reduction for strategies in infinite games
CIAA'07 Proceedings of the 12th international conference on Implementation and application of automata
Complexity bounds for regular games
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Strategy composition in compositional games
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
| Hi-index | 0.00 |
We introduce a machine model for the execution of strategies in (regular) infinite games that refines the standard model of Mealy automata. This model of controllers is formalized in the terminological framework of Turing machines. We show how polynomially sized controllers can be found for Muller and Streett games. We are able to distinguish aspects of executing strategies ("size", "latency", "space consumption") that are not visible in Mealy automata. Also, lower bound results are obtained.