{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T16:53:05Z","timestamp":1753894385598,"version":"3.41.2"},"reference-count":0,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","license":[{"start":{"date-parts":[[2023,2,15]],"date-time":"2023-02-15T00:00:00Z","timestamp":1676419200000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>We introduce good-for-games $\\omega$-pushdown automata ($\\omega$-GFG-PDA).\nThese are automata whose nondeterminism can be resolved based on the input\nprocessed so far. Good-for-gameness enables automata to be composed with games,\ntrees, and other automata, applications which otherwise require deterministic\nautomata. Our main results are that $\\omega$-GFG-PDA are more expressive than\ndeterministic $\\omega$- pushdown automata and that solving infinite games with\nwinning conditions specified by $\\omega$-GFG-PDA is EXPTIME-complete. Thus, we\nhave identified a new class of $\\omega$-contextfree winning conditions for\nwhich solving games is decidable. It follows that the universality problem for\n$\\omega$-GFG-PDA is in EXPTIME as well. Moreover, we study closure properties\nof the class of languages recognized by $\\omega$-GFG- PDA and decidability of\ngood-for-gameness of $\\omega$-pushdown automata and languages. Finally, we\ncompare $\\omega$-GFG-PDA to $\\omega$-visibly PDA, study the resources necessary\nto resolve the nondeterminism in $\\omega$-GFG-PDA, and prove that the parity\nindex hierarchy for $\\omega$-GFG-PDA is infinite.\n  This is a corrected version of the paper arXiv:2001.04392v6 published\noriginally on January 7, 2022.<\/jats:p>","DOI":"10.46298\/lmcs-18(1:3)2022","type":"journal-article","created":{"date-parts":[[2022,1,7]],"date-time":"2022-01-07T08:35:57Z","timestamp":1641544557000},"source":"Crossref","is-referenced-by-count":7,"title":["Good-for-games $\\omega$-Pushdown Automata"],"prefix":"10.46298","volume":"Volume 18, Issue 1","author":[{"given":"Karoliina","family":"Lehtinen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8038-2453","authenticated-orcid":false,"given":"Martin","family":"Zimmermann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"25203","published-online":{"date-parts":[[2023,2,15]]},"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/lmcs.episciences.org\/8935\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/lmcs.episciences.org\/8935\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,20]],"date-time":"2023-06-20T20:19:08Z","timestamp":1687292348000},"score":1,"resource":{"primary":{"URL":"https:\/\/lmcs.episciences.org\/6995"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,2,15]]},"references-count":0,"URL":"https:\/\/doi.org\/10.46298\/lmcs-18(1:3)2022","relation":{"has-preprint":[{"id-type":"arxiv","id":"2001.04392v4","asserted-by":"subject"},{"id-type":"arxiv","id":"2001.04392v3","asserted-by":"subject"}],"is-same-as":[{"id-type":"arxiv","id":"2001.04392","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.2001.04392","asserted-by":"subject"}]},"ISSN":["1860-5974"],"issn-type":[{"type":"electronic","value":"1860-5974"}],"subject":[],"published":{"date-parts":[[2023,2,15]]},"article-number":"6995"}}