{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:59:15Z","timestamp":1725562755461},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642144547"},{"type":"electronic","value":"9783642144554"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14455-4_17","type":"book-chapter","created":{"date-parts":[[2010,8,13]],"date-time":"2010-08-13T15:06:02Z","timestamp":1281711962000},"page":"173-184","source":"Crossref","is-referenced-by-count":2,"title":["On M\u00fcller Context-Free Grammars"],"prefix":"10.1007","author":[{"given":"Zolt\u00e1n","family":"\u00c9sik","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Szabolcs","family":"Iv\u00e1n","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"17_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. Comp. Sci.\u00a0156, 119\u2013144 (1996)","journal-title":"Theor. Comp. Sci."},{"key":"17_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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.\u00a03572, pp. 158\u2013167. Springer, Heidelberg (2005)"},{"key":"17_CR3","first-page":"1","volume":"55","author":"S.L. Bloom","year":"2003","unstructured":"Bloom, S.L., \u00c9sik, Z.: Deciding whether the frontier of a regular tree is scattered. Fund. Inform.\u00a055, 1\u201321 (2003)","journal-title":"Fund. Inform."},{"key":"17_CR4","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"Theoretical Computer Science (Fourth GI Conf., Aachen, 1979)","author":"L. Boasson","year":"1979","unstructured":"Boasson, L.: Context-free sets of infinite words. In: Theoretical Computer Science (Fourth GI Conf., Aachen, 1979). LNCS, vol.\u00a067, pp. 1\u20139. Springer, Heidelberg (1979)"},{"key":"17_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. System Sci.\u00a073, 1\u201324 (2007)","journal-title":"J. Comput. System Sci."},{"key":"17_CR6","first-page":"321","volume":"43","author":"V. Bruyere","year":"2009","unstructured":"Bruyere, V., Carton, O., S\u00e9nizergues, G.: Tree Automata and Automata on Linear Orderings. ITA\u00a043, 321\u2013338 (2009)","journal-title":"ITA"},{"key":"17_CR7","series-title":"LNM","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BFb0082721","volume-title":"Decidable theories, II","author":"J.R. B\u00fcchi","year":"1973","unstructured":"B\u00fcchi, J.R.: The monadic second order theory of \u03c9 1. In: Decidable theories, II. LNM, vol.\u00a0328, pp. 1\u2013127. Springer, Heidelberg (1973)"},{"issue":"1","key":"17_CR8","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 \u03c9 n -tapes. J. Comput. System Sci.\u00a017(1), 81\u201397 (1978)","journal-title":"J. Comput. System Sci."},{"key":"17_CR9","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/S0022-0000(77)80004-4","volume":"15","author":"R.S. Cohen","year":"1977","unstructured":"Cohen, R.S., Gold, A.Y.: Theory of \u03c9-languages, parts one and two. Journal of Computer and System Science\u00a015, 169\u2013208 (1977)","journal-title":"Journal of Computer and System Science"},{"key":"17_CR10","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.\u00a012, 319\u2013337 (1978)","journal-title":"RAIRO Theor. Inf."},{"key":"17_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/978-3-642-03466-4_12","volume-title":"Theoretical Aspects of Computing - ICTAC 2009","author":"Z. \u00c9sik","year":"2009","unstructured":"\u00c9sik, Z., Iv\u00e1n, S.: Context-Free Languages of Countable Words. In: Leucker, M., Morgan, C. (eds.) Theoretical Aspects of Computing - ICTAC 2009. LNCS, vol.\u00a05684, pp. 185\u2013199. Springer, Heidelberg (2009)"},{"key":"17_CR12","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1051\/ita\/1980140201311","volume":"14","author":"S. Heilbrunner","year":"1980","unstructured":"Heilbrunner, S.: An algorithm for the solution of fixed-point equations for infinite words. RAIRO Theor. Inf.\u00a014, 131\u2013141 (1980)","journal-title":"RAIRO Theor. Inf."},{"key":"17_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1007\/11549345_43","volume-title":"Mathematical Foundations of Computer Science 2005","author":"P. Hunter","year":"2005","unstructured":"Hunter, P., Dawar, A.: Complexity Bounds for Regular Games. In: Jedrzejowicz, J., Szepietowski, A. (eds.) MFCS 2005. LNCS, vol.\u00a03618, pp. 495\u2013506. Springer, Heidelberg (2005)"},{"issue":"1","key":"17_CR14","doi-asserted-by":"publisher","first-page":"71","DOI":"10.2178\/bsl\/1174668219","volume":"13","author":"A. Montalb\u00e1n","year":"2007","unstructured":"Montalb\u00e1n, A.: On the equimorphism types of linear orderings. The Bulletin of Symbolic Logic\u00a013(1), 71\u201399 (2007)","journal-title":"The Bulletin of Symbolic Logic"},{"issue":"3","key":"17_CR15","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 (French). RAIRO Inform. Th\u00e9or.\u00a012(3), 259\u2013278 (1978)","journal-title":"RAIRO Inform. Th\u00e9or."},{"key":"17_CR16","volume-title":"Linear Orderings","author":"J.G. Rosenstein","year":"1982","unstructured":"Rosenstein, J.G.: Linear Orderings. Academic Press, London (1982)"},{"key":"17_CR17","doi-asserted-by":"crossref","unstructured":"Thomas, W.: Automata on Infinite Objects. In: Handbook of Theoretical Computer Science. Formal Models and Semantics, vol.\u00a0B, pp. 133\u2013192. Elsevier\/MIT Press (1990)","DOI":"10.1016\/B978-0-444-88074-1.50009-3"},{"key":"17_CR18","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 Informatic\u00e6\u00a07, 191\u2013223 (1984)","journal-title":"Fundamenta Informatic\u00e6"},{"key":"17_CR19","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 Informatic\u00e6\u00a08, 379\u2013396 (1985)","journal-title":"Fundamenta Informatic\u00e6"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14455-4_17.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,5]],"date-time":"2021-11-05T06:01:49Z","timestamp":1636092109000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14455-4_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642144547","9783642144554"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14455-4_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}