arXiv - CS - Computer Science and Game Theory Pub Date : 2020-01-13 , DOI: arxiv-2001.04392
Karoliina Lehtinen; Martin Zimmermann

We introduce good-for-games $\omega$-pushdown automata ($\omega$-GFG-PDA). These are automata whose nondeterminism can be resolved based on the run constructed thus far. Good-for-gameness enables automata to be composed with games, trees, and other automata, applications which otherwise require deterministic automata. Our main results show that $\omega$-GFG-PDA are more expressive than deterministic $\omega$-pushdown automata and that solving infinite games with winning conditions specified by $\omega$-GFG-PDA is EXPTIME-complete, i.e., we have identified a new class of $\omega$-contextfree winning conditions for which solving games is decidable. This means in particular that the universality problem is in EXPTIME as well. Moreover, we study closure properties of the class of languages recognized by $\omega$-GFG-PDA and decidability of good-for-gameness of $\omega$-pushdown automata and languages.

down
wechat
bug