08/07/2020

Good-for-games ω-Pushdown Automata

Karoliina Lehtinen and Martin Zimmermann

Keywords: Good-for-games Automata, Pushdown Automata, Infinite Games, Contextfree languages

Abstract: We introduce good-for-games ω-pushdown automata (ω-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 are that ω-GFG-PDA are more expressive than deterministic ω-pushdown automata and that solving infinite games with winning conditions specified by ω-GFG-PDA is EXPTIME-complete. Thus, we have identified a new class of ω-contextfree winning conditions for which solving games is decidable. It follows that the universality problem for ω-GFG-PDA is in EXPTIME as well. Moreover, we study closure properties of the class of languages recognized by ω-GFG-PDA and decidability of good-for-gameness of ω-pushdown automata and languages.

 0
 0
 0
 0
This is an embedded video. Talk and the respective paper are published at ICALP 2020 virtual conference. If you are one of the authors of the paper and want to manage your upload, see the question "My papertalk has been externally embedded..." in the FAQ section.

Comments

Post Comment
no comments yet
code of conduct: tbd Characters remaining: 140

Similar Papers