{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:14:48Z","timestamp":1725664488562},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540609223"},{"type":"electronic","value":"9783540497233"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-60922-9_33","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T16:04:22Z","timestamp":1330272262000},"page":"399-413","source":"Crossref","is-referenced-by-count":16,"title":["Monadic second order logic on tree-like structures"],"prefix":"10.1007","author":[{"given":"Igor","family":"Walukiewicz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"key":"33_CR1","doi-asserted-by":"crossref","first-page":"1171","DOI":"10.2307\/2273681","volume":"48","author":"J. B\u00fcchi","year":"1983","unstructured":"J. B\u00fcchi. State strategies for games in F\u03c3\u03b4\u2229G\u03c3\u03b4. Journal of Symbolic Logic, 48:1171\u20131198, 1983.","journal-title":"Journal of Symbolic Logic"},{"key":"33_CR2","doi-asserted-by":"crossref","unstructured":"B. Courcelle. The monadic second-order logic on graphs IX: machines and behaviours. Theoretical Computer Science, 149, 1995.","DOI":"10.1016\/0304-3975(95)00049-3"},{"key":"33_CR3","unstructured":"B. Courcelle and I. Walukiewicz. Monadic second-order logic, graphs and unfoldings of transition systems. University of Aarhus BRICS report RS-95-44. Presented at CSL'95."},{"key":"33_CR4","doi-asserted-by":"crossref","unstructured":"E. Emerson and C. Jutla. Tree automata, mu-calculus and determinacy. In Proc. FOCS 91, 1991.","DOI":"10.1109\/SFCS.1991.185392"},{"key":"33_CR5","doi-asserted-by":"crossref","unstructured":"Y. Gurevich and L. Harrington. Trees, automata and games. In 14th Symp. on Theory of Computations, ACM, pages 60\u201365, 1982.","DOI":"10.1145\/800070.802177"},{"key":"33_CR6","doi-asserted-by":"crossref","unstructured":"D. Janin and I. Walukiewicz. Automata for the \u03bc-calculus and related results. In MFCS'95, volume 969 of LNCS, pages 552\u2013562, 1995.","DOI":"10.1007\/3-540-60246-1_160"},{"key":"33_CR7","doi-asserted-by":"crossref","unstructured":"A. W. Mostowski. Regular expressions for infinite trees and a standard form of automata. In A. Skowron, editor, Fifth Symposium on Computation Theory, volume 208 of LNCS, pages 157\u2013168, 1984.","DOI":"10.1007\/3-540-16066-3_15"},{"key":"33_CR8","unstructured":"A. W. Mostowski. Games with forbidden positions. Technical Report 78, University of Gdansk, 1991."},{"key":"33_CR9","doi-asserted-by":"crossref","unstructured":"D. Niwi\u0144ski. Fixed points vs. infinite generation. In Proc. 3rd. IEEE LICS, pages 402\u2013409, 1988.","DOI":"10.1109\/LICS.1988.5137"},{"key":"33_CR10","first-page":"1","volume":"141","author":"M. Rabin","year":"1969","unstructured":"M. Rabin. Decidability of second-order theories and automata on infinite trees. Trans. Amer. Math. Soc., 141:1\u201335, 1969.","journal-title":"Trans. Amer. Math. Soc."},{"key":"33_CR11","doi-asserted-by":"crossref","unstructured":"A. Semenov. Decidability of monadic theories. In MFCS'84, volume 176 of LNCS, pages 162\u2013175. Springer-Verlag, 1984.","DOI":"10.1007\/BFb0030296"},{"key":"33_CR12","doi-asserted-by":"crossref","first-page":"379","DOI":"10.2307\/1971037","volume":"102","author":"S. Shelah","year":"1975","unstructured":"S. Shelah. The monadic second order theory of order. Annals of Mathematics, 102:379\u2013419, 1975.","journal-title":"Annals of Mathematics"},{"key":"33_CR13","doi-asserted-by":"crossref","unstructured":"W. Thomas. Automata on infinite objects. In J. Leeuven, editor, Handbook of Theoretical Computer Science Vol. B, pages 995\u20131072. Elesvier, 1990.","DOI":"10.1016\/B978-0-444-88074-1.50009-3"},{"key":"33_CR14","doi-asserted-by":"crossref","unstructured":"W. Thomas. On logics, tilings, and automata. In ICALP '91, volume 510 of LNCS, pages 441\u2013454, 1991.","DOI":"10.1007\/3-540-54233-7_154"}],"container-title":["Lecture Notes in Computer Science","STACS 96"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60922-9_33.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:02:34Z","timestamp":1605628954000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60922-9_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540609223","9783540497233"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-60922-9_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}