2017/09/07 by Martin Zimmermann
Computer Science · #cs.GT #cs.FL #cs.LO
paper · pdf · doi:10.4204/eptcs.256.11
published as EPTCS 256, 2017, pp. 151-165 · In Proceedings GandALF 2017, arXiv:1709.01761. Full version at arXiv:1704.08887
arxiv created 2017/09/07 · arxiv updated 2017/09/13
What is a finite-state strategy in a delay game? We answer this surprisingly non-trivial question and present a very general framework for computing such strategies: they exist for all winning conditions that are recognized by automata with acceptance conditions that satisfy a certain aggregation property. Our framework also yields upper bounds on the complexity of determining the winner of such delay games and upper bounds on the necessary lookahead to win the game. In particular, we cover all previous results of that kind as special cases of our uniform approach.