{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,6]],"date-time":"2026-04-06T08:22:39Z","timestamp":1775463759191,"version":"3.50.1"},"reference-count":23,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2002,3,1]],"date-time":"2002-03-01T00:00:00Z","timestamp":1014940800000},"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":4156,"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":[[2002,3]]},"DOI":"10.1016\/s0304-3975(01)00185-2","type":"journal-article","created":{"date-parts":[[2002,10,15]],"date-time":"2002-10-15T13:27:27Z","timestamp":1034688447000},"page":"311-346","source":"Crossref","is-referenced-by-count":65,"title":["Monadic second-order logic on tree-like structures"],"prefix":"10.1016","volume":"275","author":[{"given":"Igor","family":"Walukiewicz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(01)00185-2_BIB1","doi-asserted-by":"crossref","first-page":"767","DOI":"10.1090\/S0002-9904-1965-11384-2","article-title":"Decision methods in the theory of ordinals","volume":"71","author":"B\u00fcchi","year":"1965","journal-title":"Bull. Amer. Math. Soc."},{"key":"10.1016\/S0304-3975(01)00185-2_BIB2","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":"Buchi","year":"1983","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/S0304-3975(01)00185-2_BIB3","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/0304-3975(94)90268-2","article-title":"Monadic second-order graph transductions","volume":"126","author":"Courcelle","year":"1994","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(01)00185-2_BIB4","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/S0168-0072(97)00048-1","article-title":"Monadic second-order logic, graphs and unfoldings of transition systems","volume":"92","author":"Courcelle","year":"1998","journal-title":"Ann. Pure Appl. Logic"},{"key":"10.1016\/S0304-3975(01)00185-2_BIB5","article-title":"Uniform interpolation, automata and the modal mu-calculus","volume":"Vol. 1","author":"D'Agostino","year":"1996"},{"key":"10.1016\/S0304-3975(01)00185-2_BIB6","series-title":"Finite Model Theory.","author":"Ebbinghaus","year":"1995"},{"key":"10.1016\/S0304-3975(01)00185-2_BIB7","doi-asserted-by":"crossref","first-page":"169","DOI":"10.2307\/2269808","article-title":"Decidability and undecidability of extensions of second (first) order theory of (generalized) successor","volume":"31","author":"Elgot","year":"1966","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/S0304-3975(01)00185-2_BIB8","first-page":"368","article-title":"Tree automata, mu-calculus and determinacy","author":"Emerson","year":"1991","journal-title":"Proceedings of the FOCS 91"},{"key":"10.1016\/S0304-3975(01)00185-2_BIB9","doi-asserted-by":"crossref","first-page":"552","DOI":"10.1007\/3-540-60246-1_160","article-title":"Automata for the \u03bc-calculus and related results","volume":"Vol. 969","author":"Janin","year":"1995","journal-title":"Proceedings of the MFCS \u201995 Lecture Notes in Computer Science"},{"key":"10.1016\/S0304-3975(01)00185-2_BIB10","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/3-540-61604-7_60","article-title":"On the expressive completeness of the propositional mu-calculus with respect to monadic second order logic","volume":"Vol. 1119","author":"Janin","year":"1996","journal-title":"Proceedings of the CONCUR\u201996 Lecture Notes in Computer Science"},{"key":"10.1016\/S0304-3975(01)00185-2_BIB11","series-title":"Classical Descriptive Set Theory","volume":"Vol. 156","author":"Kechris","year":"1995"},{"key":"10.1016\/S0304-3975(01)00185-2_BIB12","first-page":"382","article-title":"Progress measures, immediate determinacy and a subset construction for tree automata","author":"Klarlund","year":"1992","journal-title":"Proceedings of the LICS \u201992"},{"key":"10.1016\/S0304-3975(01)00185-2_BIB13","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(01)00185-2_BIB14","series-title":"Descriptive Set Theory","volume":"Vol. 100","author":"Moschovakis","year":"1980"},{"key":"10.1016\/S0304-3975(01)00185-2_BIB15","unstructured":"A.W. Mostowski, Games with forbidden positions. Tech. Report No. 78, University of Gdansk, 1991."},{"key":"10.1016\/S0304-3975(01)00185-2_BIB16","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(01)00185-2_BIB17","series-title":"Handbook of Mathematical Logic","article-title":"Decidable theories","author":"Rabin","year":"1977"},{"key":"10.1016\/S0304-3975(01)00185-2_BIB18","doi-asserted-by":"crossref","unstructured":"A. Semenov, Decidability of monadic theories, Proceedings of the MFCS\u201984, Lecture Notes in Computer Science, Vol. 176, Springer, Berlin, 1984, pp. 162\u2013175.","DOI":"10.1007\/BFb0030296"},{"key":"10.1016\/S0304-3975(01)00185-2_BIB19","doi-asserted-by":"crossref","first-page":"379","DOI":"10.2307\/1971037","article-title":"The monadic second order theory of order","volume":"102","author":"Shelah","year":"1975","journal-title":"Ann. Math."},{"key":"10.1016\/S0304-3975(01)00185-2_BIB20","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/0890-5401(89)90031-X","article-title":"An automata theoretic procedure for the propositional mu-calculus","volume":"81","author":"Streett","year":"1989","journal-title":"Inform. Comput."},{"key":"10.1016\/S0304-3975(01)00185-2_BIB21","unstructured":"J. Stupp, The lattice-model is recursive in the original model, Institute of Mathematics, The Hebrew University, Jerusalem, January 1975."},{"key":"10.1016\/S0304-3975(01)00185-2_BIB22","article-title":"Languages, automata, and logic","volume":"Vol. 3","author":"Thomas","year":"1997"},{"key":"10.1016\/S0304-3975(01)00185-2_BIB23","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/S0304-3975(98)00009-7","article-title":"Infinite games on finitely coloured graphs with applications to automata on infinite trees","volume":"200","author":"Zielonka","year":"1998","journal-title":"Theoret. Comput. Sci."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501001852?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501001852?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T12:20:17Z","timestamp":1556713217000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397501001852"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,3]]},"references-count":23,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2002,3]]}},"alternative-id":["S0304397501001852"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(01)00185-2","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2002,3]]}}}