{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T23:40:02Z","timestamp":1742946002700,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319411132"},{"type":"electronic","value":"9783319411149"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-41114-9_7","type":"book-chapter","created":{"date-parts":[[2016,6,27]],"date-time":"2016-06-27T10:05:14Z","timestamp":1467021914000},"page":"87-97","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["MSO-definable Properties of Muller Context-Free Languages Are Decidable"],"prefix":"10.1007","author":[{"given":"Zolt\u00e1n","family":"\u00c9sik","sequence":"first","affiliation":[]},{"given":"Szabolcs","family":"Iv\u00e1n","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,6,28]]},"reference":[{"issue":"1\u20132","key":"7_CR1","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/0304-3975(95)00006-2","volume":"156","author":"N Bedon","year":"1996","unstructured":"Bedon, N.: Finite automata and ordinals. Theor. Comput. Sci. 156(1\u20132), 119\u2013144 (1996)","journal-title":"Theor. Comput. Sci."},{"key":"7_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1007\/978-3-540-79709-8_11","volume-title":"Computer Science \u2013 Theory and Applications","author":"N Bedon","year":"2008","unstructured":"Bedon, N., B\u00e8s, A., Carton, O., Rispal, C.: Logic and rational languages of words indexed by linear orderings. In: Hirsch, E.A., Razborov, A.A., Semenov, A., Slissenko, A. (eds.) CSR 2008. LNCS, vol. 5010, pp. 76\u201385. Springer, Heidelberg (2008)"},{"key":"7_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1007\/11505877_14","volume-title":"Developments in Language Theory","author":"A B\u00e8s","year":"2005","unstructured":"B\u00e8s, A., Carton, O.: A kleene theorem for languages of words indexed by linear orderings. In: De Felice, C., Restivo, A. (eds.) DLT 2005. LNCS, vol. 3572, pp. 158\u2013167. Springer, Heidelberg (2005)"},{"key":"7_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-09118-1_1","volume-title":"Theoretical Computer Science 4th GI Conference","author":"L Boasson","year":"1979","unstructured":"Boasson, L.: Context-free sets of infinite words. In: Weihrauch, K. (ed.) Theoretical Computer Science 4th GI Conference. LNCS, vol. 67, pp. 1\u20139. Springer, Heidelberg (1979)"},{"issue":"1","key":"7_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jcss.2006.10.009","volume":"73","author":"V Bruy\u00e8re","year":"2007","unstructured":"Bruy\u00e8re, V., Carton, O.: Automata on linear orderings. J. Comput. Syst. Sci. 73(1), 1\u201324 (2007)","journal-title":"J. Comput. Syst. Sci."},{"key":"7_CR6","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BFb0082721","volume-title":"Decidable Theories II","author":"J Richard B\u00fcchi","year":"1973","unstructured":"Richard B\u00fcchi, J.: The monadic second order theory of $$\\omega _1$$. In: M\u00fcller, G.H., Siefkes, D. (eds.) Decidable Theories II. Lecture Notes in Mathematics, vol. 328, pp. 1\u2013127. Springer, Heidelberg (1973)"},{"issue":"1","key":"7_CR7","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/0022-0000(78)90036-3","volume":"17","author":"Y Choueka","year":"1978","unstructured":"Choueka, Y.: Finite automata, definable sets, and regular expressions over $$\\omega ^n$$-tapes. J. Comput. Syst. Sci. 17(1), 81\u201397 (1978)","journal-title":"J. Comput. Syst. Sci."},{"key":"7_CR8","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/S0022-0000(77)80004-4","volume":"15","author":"RS Cohen","year":"1977","unstructured":"Cohen, R.S., Gold, A.Y.: Theory of $$\\omega $$-languages, parts one and two. J. Comput. Syst. Sci. 15, 169\u2013208 (1977)","journal-title":"J. Comput. Syst. Sci."},{"issue":"4","key":"7_CR9","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1051\/ita\/1978120403191","volume":"12","author":"B Courcelle","year":"1978","unstructured":"Courcelle, B.: Frontiers of infinite trees. RAIRO - Theor. Inf. Appl. - Informatique Th\u00e9orique et Applications 12(4), 319\u2013337 (1978)","journal-title":"RAIRO - Theor. Inf. Appl. - Informatique Th\u00e9orique et Applications"},{"issue":"8\u201310","key":"7_CR10","doi-asserted-by":"publisher","first-page":"805","DOI":"10.1016\/j.tcs.2010.11.026","volume":"412","author":"Z \u00c9sik","year":"2011","unstructured":"\u00c9sik, Z., Iv\u00e1n, S.: B\u00fcchi context-free languages. Theor. Comput. Sci. 412(8\u201310), 805\u2013821 (2011)","journal-title":"Theor. Comput. Sci."},{"key":"7_CR11","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/j.tcs.2011.10.012","volume":"416","author":"Z \u00c9sik","year":"2012","unstructured":"\u00c9sik, Z., Iv\u00e1n, S.: On M\u00fcller context-free grammars. Theor. Comput. Sci. 416, 17\u201332 (2012)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"7_CR12","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1051\/ita\/1978120302591","volume":"12","author":"M Nivat","year":"1978","unstructured":"Nivat, M.: Sur les ensembles de mots infinis engendr\u00e9s par une grammaire alg\u00e9brique. RAIRO - Theor. Inf. Appl. - Informatique Th\u00e9orique et Applications 12(3), 259\u2013278 (1978)","journal-title":"RAIRO - Theor. Inf. Appl. - Informatique Th\u00e9orique et Applications"},{"key":"7_CR13","unstructured":"Perrin, D., Pin, J.\u00c9.: Infinite Words: Automata, Semigroups, Logic and Games. Pure and Applied Mathematics. Elsevier Science (2004)"},{"key":"7_CR14","first-page":"1","volume":"141","author":"MO Rabin","year":"1969","unstructured":"Rabin, M.O.: Decidability of second order theories and automata on infinite trees. Trans. AMS 141, 1\u201335 (1969)","journal-title":"Trans. AMS"},{"key":"7_CR15","series-title":"Pure and Applied Mathematics","volume-title":"Linear Orderings","author":"JG Rosenstein","year":"1982","unstructured":"Rosenstein, J.G.: Linear Orderings. Pure and Applied Mathematics. Academic Press, London (1982)"},{"issue":"2","key":"7_CR16","doi-asserted-by":"crossref","first-page":"191","DOI":"10.3233\/FI-1984-7203","volume":"7","author":"J Wojciechowski","year":"1984","unstructured":"Wojciechowski, J.: Classes of transfinite sequences accepted by finite automata. Fundamenta Informaticae 7(2), 191\u2013223 (1984)","journal-title":"Fundamenta Informaticae"},{"issue":"3\u20134","key":"7_CR17","doi-asserted-by":"crossref","first-page":"379","DOI":"10.3233\/FI-1985-83-407","volume":"8","author":"J Wojciechowski","year":"1985","unstructured":"Wojciechowski, J.: Finite automata on transfinite sequences and regular expressions. Fundamenta Informaticae 8(3\u20134), 379\u2013396 (1985)","journal-title":"Fundamenta Informaticae"}],"container-title":["Lecture Notes in Computer Science","Descriptional Complexity of Formal Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-41114-9_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,2]],"date-time":"2022-07-02T06:48:32Z","timestamp":1656744512000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-41114-9_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319411132","9783319411149"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-41114-9_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"28 June 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}