2012/10/09 by Wladimir Fridman, Martin Zimmermann
Computer Science · #cs.GT
paper · pdf · doi:10.4204/eptcs.96.14
published as EPTCS 96, 2012, pp. 183-196 · In Proceedings GandALF 2012, arXiv:1210.2028
arxiv created 2012/10/09 · arxiv updated 2012/10/10
We continue the investigation of finite-duration variants of infinite-duration games by extending known results for games played on finite graphs to those played on infinite ones. In particular, we establish an equivalence between pushdown parity games and a finite-duration variant. This allows us to determine the winner of a pushdown parity game by solving a reachability game on a finite tree.