{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T14:26:48Z","timestamp":1777645608015,"version":"3.51.4"},"reference-count":0,"publisher":"SAGE Publications","issue":"1-4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["FI"],"published-print":{"date-parts":[[2022,8,30]]},"abstract":"<jats:p>Infinite games (in the form of Gale-Stewart games) are studied where a play is a sequence of natural numbers chosen by two players in alternation, the winning condition being a subset of the Baire space \u03c9\u03c9. We consider such games defined by a natural kind of parity automata over the alphabet \u2115, called \u2115-MSO-automata, where transitions are specified by monadic second-order formulas over the successor structure of the natural numbers. We show that the classical B\u00fcchi-Landweber Theorem (for finite-state games in the Cantor space 2\u03c9) holds again for the present games: A game defined by a deterministic parity \u2115-MSO-automaton is determined, the winner can be computed, and an \u2115-MSO-transducer realizing a winning strategy for the winner can be constructed.<\/jats:p>","DOI":"10.3233\/fi-222119","type":"journal-article","created":{"date-parts":[[2022,8,30]],"date-time":"2022-08-30T11:39:32Z","timestamp":1661859572000},"page":"63-88","source":"Crossref","is-referenced-by-count":0,"title":["Solving Infinite Games in the Baire Space"],"prefix":"10.1177","volume":"186","author":[{"given":"Benedikt","family":"Br\u00fctsch","sequence":"first","affiliation":[{"name":"Chair of Computer Science 7, RWTH Aachen University, Germany. bruetsch@automata.rwth-aachen.de, thomas@cs.rwth-aachen.de"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wolfgang","family":"Thomas","sequence":"additional","affiliation":[{"name":"Chair of Computer Science 7, RWTH Aachen University, Germany. bruetsch@automata.rwth-aachen.de, thomas@cs.rwth-aachen.de"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","container-title":["Fundamenta Informaticae"],"original-title":[],"link":[{"URL":"https:\/\/content.iospress.com\/download?id=10.3233\/FI-222119","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T06:32:44Z","timestamp":1777444364000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/full\/10.3233\/FI-222119"}},"subtitle":[],"editor":[{"given":"Arnon","family":"Avron","sequence":"additional","affiliation":[],"role":[{"role":"editor","vocabulary":"crossref"}]},{"given":"Nachum","family":"Dershowitz","sequence":"additional","affiliation":[],"role":[{"role":"editor","vocabulary":"crossref"}]},{"given":"Alexander","family":"Rabinovich","sequence":"additional","affiliation":[],"role":[{"role":"editor","vocabulary":"crossref"}]}],"short-title":[],"issued":{"date-parts":[[2022,8,30]]},"references-count":0,"journal-issue":{"issue":"1-4"},"URL":"https:\/\/doi.org\/10.3233\/fi-222119","relation":{},"ISSN":["0169-2968","1875-8681"],"issn-type":[{"value":"0169-2968","type":"print"},{"value":"1875-8681","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,8,30]]}}}