{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,11]],"date-time":"2026-06-11T10:04:19Z","timestamp":1781172259000,"version":"3.54.1"},"reference-count":32,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1998,6,1]],"date-time":"1998-06-01T00:00:00Z","timestamp":896659200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5525,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1998,6]]},"DOI":"10.1016\/s0304-3975(98)00009-7","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T19:40:02Z","timestamp":1049744402000},"page":"135-183","source":"Crossref","is-referenced-by-count":311,"title":["Infinite games on finitely coloured graphs with applications to automata on infinite trees"],"prefix":"10.1016","volume":"200","author":[{"given":"Wieslaw","family":"Zielonka","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(98)00009-7_BIB1","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/0304-3975(95)00069-9","article-title":"An initial semantics of the \u03bc-calculus on trees and Rabin's complementation theorem","volume":"148","author":"Arnold","year":"1994","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(98)00009-7_BIB2","series-title":"The Classical Decision Problems","author":"B\u00f6rger","year":"1997"},{"key":"10.1016\/S0304-3975(98)00009-7_BIB3","series-title":"Fundamentals of Computation Theory","first-page":"367","article-title":"Using determinacy to eliminate quantifiers","volume":"vol. 56","author":"B\u00fcchi","year":"1997"},{"key":"10.1016\/S0304-3975(98)00009-7_BIB4","doi-asserted-by":"crossref","first-page":"1171","DOI":"10.2307\/2273681","article-title":"State-strategies for games in F\u03c3\u03b4 \u2229 G\u03b4\u03c3","volume":"48","author":"B\u00fcchi","year":"1983","journal-title":"J. Symbol. Logic"},{"key":"10.1016\/S0304-3975(98)00009-7_BIB5","series-title":"Advances in Game Theory","first-page":"85","article-title":"Infinite games of perfect information","volume":"vol. 52","author":"Davis","year":"1964"},{"key":"10.1016\/S0304-3975(98)00009-7_BIB6","unstructured":"V. Diekert, Personal communication, March 1996."},{"key":"10.1016\/S0304-3975(98)00009-7_BIB7","series-title":"12th Annual Symp. on Logic in Computer Science","article-title":"How much memory is needed to win infinite games?","author":"Dziembowski","year":"1997"},{"key":"10.1016\/S0304-3975(98)00009-7_BIB8","series-title":"Proc. 29th IEEE Symp. on Foundations of Computer Science","first-page":"328","article-title":"The complexity of tree automata and logics of programs","author":"Emerson","year":"1988"},{"key":"10.1016\/S0304-3975(98)00009-7_BIB9","series-title":"Proc. 32th IEEE Symp. on Foundations of Computer Science","first-page":"368","article-title":"Tree automata, mu-calculus and determinacy","author":"Emerson","year":"1991"},{"key":"10.1016\/S0304-3975(98)00009-7_BIB10","series-title":"The Collected Works of J. Richard B\u00fcchi","first-page":"518","article-title":"Games people play","author":"Gurevich","year":"1990"},{"key":"10.1016\/S0304-3975(98)00009-7_BIB11","series-title":"Proc. 14th ACM Symp. on the Theory of Computing","first-page":"60","article-title":"Trees, automata and game","author":"Gurevich","year":"1982"},{"key":"10.1016\/S0304-3975(98)00009-7_BIB12","series-title":"ICALP'96","first-page":"312","article-title":"Fixpoints for Rabin tree automata make complementation easy","volume":"vol. 1099","author":"Kaivola","year":"1996"},{"key":"10.1016\/S0304-3975(98)00009-7_BIB13","series-title":"Classical Descriptive Set Theory","author":"Kechris","year":"1995"},{"key":"10.1016\/S0304-3975(98)00009-7_BIB14","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/0168-0072(94)90086-8","article-title":"Progress measures, immediate determinacy, and a subset construction for tree automata","volume":"69","author":"Klarlund","year":"1994","journal-title":"Ann. Pure Appl. Logic"},{"key":"10.1016\/S0304-3975(98)00009-7_BIB15","series-title":"Proc. 6th Symp. on Logic in Comp. Sci.","article-title":"Rabin measures and their applications to fairness and automata theory","author":"Klarlund","year":"1991"},{"key":"10.1016\/S0304-3975(98)00009-7_BIB16","volume":"vol. 1","author":"Kuratowski","year":"1958"},{"key":"10.1016\/S0304-3975(98)00009-7_BIB17","series-title":"Computer Aided Verification","first-page":"239","article-title":"On polynomial-size programs winning finite-state games","volume":"vol. 939","author":"Lescow","year":"1995"},{"key":"10.1016\/S0304-3975(98)00009-7_BIB18","doi-asserted-by":"crossref","first-page":"363","DOI":"10.2307\/1971035","article-title":"Borel determinacy","volume":"102","author":"Martin","year":"1975","journal-title":"Ann. Math."},{"key":"10.1016\/S0304-3975(98)00009-7_BIB19","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/0168-0072(93)90036-D","article-title":"Infinite games played on finite graphs","volume":"65","author":"McNaughton","year":"1993","journal-title":"Ann. Pure Appl. Logic"},{"key":"10.1016\/S0304-3975(98)00009-7_BIB20","series-title":"5th Symp. Computation Theory","first-page":"157","article-title":"Regular expressions for infinite trees and a standard form of automata","volume":"vol. 208","author":"Mostowski","year":"1984"},{"key":"10.1016\/S0304-3975(98)00009-7_BIB21","article-title":"Games with forbidden positions","author":"Mostowski","year":"1991"},{"key":"10.1016\/S0304-3975(98)00009-7_BIB22_1","first-page":"220","article-title":"Games on infinite trees and automata with dead-ends. A new proof for the decidability of the monadic second-order theory of two successors","volume":"48","author":"Muchnik","year":"1992","journal-title":"Bull. EATCS"},{"key":"10.1016\/S0304-3975(98)00009-7_BIB22_2","volume":"24","author":"Muchnik","year":"1984","journal-title":"Semiotics and Information"},{"key":"10.1016\/S0304-3975(98)00009-7_BIB23","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/0304-3975(94)00214-4","article-title":"Simulating alternating tree automata by nondeterministic automata: New results and new proofs of the theorems of Rabin, McNaughton and Safra","volume":"141","author":"Muller","year":"1995","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(98)00009-7_BIB24","article-title":"Mots infinis","author":"Perrin","year":"1993"},{"key":"10.1016\/S0304-3975(98)00009-7_BIB25","first-page":"1","article-title":"Decidability of second order theories and automata on infinite trees","volume":"141","author":"Rabin","year":"1969","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/S0304-3975(98)00009-7_BIB26","article-title":"Automata on infinte objects and Church's problem","volume":"vol. 13","author":"Rabin","year":"1972"},{"key":"10.1016\/S0304-3975(98)00009-7_BIB27","series-title":"Proc. of 24th ACM Symp. on the Theory of Computing","first-page":"275","article-title":"Exponential determinization for \u03c9-automata with strong-fairness acceptance condition","author":"Safra","year":"1992"},{"key":"10.1016\/S0304-3975(98)00009-7_BIB28","series-title":"STACS 95","article-title":"On the synthesis of stategies in infinite games","volume":"vol. 900","author":"Thomas","year":"1995"},{"key":"10.1016\/S0304-3975(98)00009-7_BIB29","article-title":"Languages, automata, and logic","volume":"vol. 3","author":"Thomas","year":"1997"},{"key":"10.1016\/S0304-3975(98)00009-7_BIB30","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/0168-0072(90)90024-V","article-title":"Extension of Gurevich-Harrington's restricted determinacy theorem: a criterion for the winning player and an explicit class of winning strategies","volume":"48","author":"Yakhnis","year":"1990","journal-title":"Ann. Pure Appl. Logic"},{"key":"10.1016\/S0304-3975(98)00009-7_BIB31","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1093\/logcom\/4.3.273","article-title":"Unforgettable forgetful determinacy","volume":"4","author":"Zeitman","year":"1994","journal-title":"J. Logic Comput."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397598000097?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397598000097?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,29]],"date-time":"2019-04-29T07:26:42Z","timestamp":1556522802000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397598000097"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,6]]},"references-count":32,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1998,6]]}},"alternative-id":["S0304397598000097"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(98)00009-7","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1998,6]]}}}