Lehtinen, Karoliina and Zimmermann, Martin ORCID: 0000-0002-8038-2453
(2020)
GOOD-FOR-GAMES ω-PUSHDOWN AUTOMATA.
LOGICAL METHODS IN COMPUTER SCIENCE, 18 (1).
Text
2001.04392.pdf - Published version Download (751kB) | Preview |
Abstract
<jats:p>We introduce good-for-games $\omega$-pushdown automata ($\omega$-GFG-PDA). These are automata whose nondeterminism can be resolved based on the input processed so 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 $\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. Thus, we have identified a new class of $\omega$-contextfree winning conditions for which solving games is decidable. It follows that the universality problem for $\omega$-GFG-PDA 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. Finally, we compare $\omega$-GFG-PDA to $\omega$-visibly PDA, study the resources necessary to resolve the nondeterminism in $\omega$-GFG-PDA, and prove that the parity index hierarchy for $\omega$-GFG-PDA is infinite. This is a corrected version of the paper arXiv:2001.04392v6 published originally on January 7, 2022.</jats:p>
Item Type: | Article |
---|---|
Uncontrolled Keywords: | Good-for-games, Pushdown Automata, Infinite Games |
Divisions: | Faculty of Science and Engineering > School of Electrical Engineering, Electronics and Computer Science |
Depositing User: | Symplectic Admin |
Date Deposited: | 10 Feb 2022 11:18 |
Last Modified: | 19 Oct 2023 09:32 |
DOI: | 10.46298/LMCS-18(1:3)2022 |
Related URLs: | |
URI: | https://livrepository.liverpool.ac.uk/id/eprint/3148687 |