{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,5]],"date-time":"2025-04-05T04:03:08Z","timestamp":1743825788425,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":42,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642316524"},{"type":"electronic","value":"9783642316531"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31653-1_14","type":"book-chapter","created":{"date-parts":[[2012,7,14]],"date-time":"2012-07-14T09:51:39Z","timestamp":1342259499000},"page":"142-153","source":"Crossref","is-referenced-by-count":2,"title":["On Context-Free Languages of Scattered Words"],"prefix":"10.1007","author":[{"given":"Zoltan","family":"\u00c9sik","sequence":"first","affiliation":[]},{"given":"Satoshi","family":"Okawa","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"14_CR1","unstructured":"Arnold, A., Niwinski, D.: Rudiments of the \u03bc-Calculus. Elsevier (2011)"},{"key":"14_CR2","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. Theoretical Computer Science\u00a0156, 119\u2013144 (1996)","journal-title":"Theoretical Computer Science"},{"key":"14_CR3","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.\u00a05010, pp. 76\u201385. Springer, Heidelberg (2008)"},{"key":"14_CR4","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.\u00a03572, pp. 158\u2013167. Springer, Heidelberg (2005)"},{"key":"14_CR5","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1016\/S0304-3975(00)00040-2","volume":"259","author":"S.L. Bloom","year":"2001","unstructured":"Bloom, S.L., Choffrut, C.: Long words: the theory of concatenation and \u03c9-power. Theoretical Computer Science\u00a0259, 533\u2013548 (2001)","journal-title":"Theoretical Computer Science"},{"key":"14_CR6","doi-asserted-by":"crossref","unstructured":"Bloom, S.L., \u00c9sik, Z.: Iteration Theories. EATCS Monograph Series in Theoretical Computer Science. Springer (1993)","DOI":"10.1007\/978-3-642-78034-9"},{"key":"14_CR7","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1051\/ita:2004005","volume":"38","author":"S.L. Bloom","year":"2004","unstructured":"Bloom, S.L., \u00c9sik, Z.: Axiomating omega and omega-op powers of words. Theoretical Informatics and Applications\u00a038, 3\u201317 (2004)","journal-title":"Theoretical Informatics and Applications"},{"key":"14_CR8","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/j.ic.2005.01.004","volume":"197","author":"S.L. Bloom","year":"2005","unstructured":"Bloom, S.L., \u00c9sik, Z.: The equational theory of regular words. Information and Computation\u00a0197, 55\u201389 (2005)","journal-title":"Information and Computation"},{"key":"14_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-73859-6_1","volume-title":"Algebra and Coalgebra in Computer Science","author":"S.L. Bloom","year":"2007","unstructured":"Bloom, S.L., \u00c9sik, Z.: Regular and Algebraic Words and Ordinals. In: Mossakowski, T., Montanari, U., Haveraaen, M. (eds.) CALCO 2007. LNCS, vol.\u00a04624, pp. 1\u201315. Springer, Heidelberg (2007)"},{"key":"14_CR10","doi-asserted-by":"crossref","first-page":"383","DOI":"10.3233\/FI-2010-255","volume":"99","author":"S.L. Bloom","year":"2010","unstructured":"Bloom, S.L., \u00c9sik, Z.: Algebraic ordinals. Fundamenta Informaticae\u00a099, 383\u2013407 (2010)","journal-title":"Fundamenta Informaticae"},{"key":"14_CR11","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1142\/S0129054111008155","volume":"22","author":"S.L. Bloom","year":"2011","unstructured":"Bloom, S.L., \u00c9sik, Z.: Algebraic linear orderings. Int. J. Foundations of Computer Science\u00a022, 491\u2013515 (2011)","journal-title":"Int. J. Foundations of Computer Science"},{"key":"14_CR12","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"Theoretical Computer Science","author":"L. Boasson","year":"1979","unstructured":"Boasson, L.: Context-free Sets of Infinite Words. In: Weihrauch, K. (ed.) GI-TCS 1979. LNCS, vol.\u00a067, pp. 1\u20139. Springer, Heidelberg (1979)"},{"key":"14_CR13","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. Computer and System Sciences\u00a073, 1\u201324 (2007)","journal-title":"J. Computer and System Sciences"},{"key":"14_CR14","doi-asserted-by":"crossref","unstructured":"B\u00fcchi, J.R.: The monadic second order theory of \u03c9 1. In: Decidable Theories, II. Lecture Notes in Math., vol.\u00a0328, pp. 1\u2013127. Springer (1973)","DOI":"10.1007\/BFb0082721"},{"issue":"1","key":"14_CR15","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. Computer and System Sciences\u00a017(1), 81\u201397 (1978)","journal-title":"J. Computer and System Sciences"},{"key":"14_CR16","doi-asserted-by":"publisher","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. J. Computer and System Sciences\u00a015, 169\u2013208 (1977)","journal-title":"J. Computer and System Sciences"},{"key":"14_CR17","first-page":"319","volume":"12","author":"B. Courcelle","year":"1978","unstructured":"Courcelle, B.: Frontiers of infinite trees. Theoretical Informatics and Applications\u00a012, 319\u2013337 (1978)","journal-title":"Theoretical Informatics and Applications"},{"key":"14_CR18","unstructured":"Eilenberg, S.: Automata, Languages, and Machines, vol.\u00a0A. Academic Press (1974)"},{"key":"14_CR19","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/j.ipl.2010.10.018","volume":"111","author":"Z. \u00c9sik","year":"2011","unstructured":"\u00c9sik, Z.: An undecidable property of context-free linear orders. Information Processing Letters\u00a0111, 107\u2013109 (2011)","journal-title":"Information Processing Letters"},{"key":"14_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1007\/978-3-642-22321-1_19","volume-title":"Developments in Language Theory","author":"Z. \u00c9sik","year":"2011","unstructured":"\u00c9sik, Z.: Scattered Context-Free Linear Orderings. In: Mauri, G., Leporati, A. (eds.) DLT 2011. LNCS, vol.\u00a06795, pp. 216\u2013227. Springer, Heidelberg (2011)"},{"key":"14_CR21","unstructured":"\u00c9sik, Z., Iv\u00e1n, S.: Context-free ordinals, arXiv:1103.5421v1 (2011)"},{"key":"14_CR22","doi-asserted-by":"crossref","unstructured":"\u00c9sik, Z., Ito, M., Kuich, W.: Linear languages of finite and infinite words. In: Proc. Automata, Formal Languages, and Algebraic Systems, pp. 33\u201346. World Scientific (2010)","DOI":"10.1142\/9789814317610_0003"},{"key":"14_CR23","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. Theoretical Computer Science\u00a0412, 805\u2013821 (2011); Extended Abstract in Proc. ICTAC 2009, (Kuala Lumpur), LNCS, vol. 5684, pp. 185\u2013199. Springer (2009)","journal-title":"Theoretical Computer Science"},{"key":"14_CR24","doi-asserted-by":"crossref","unstructured":"\u00c9sik, Z., Iv\u00e1n, S.: On Muller context-free grammars. Theoretical Computer Science (to appear); Extended Abstract in Proc. Developments in Language Theory, (London, ON, 2010), LNCS, vol. 6224, pp. 173\u2013184. Springer (2010)","DOI":"10.1007\/978-3-642-14455-4_17"},{"key":"14_CR25","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/s00233-007-0709-7","volume":"75","author":"Z. \u00c9sik","year":"2007","unstructured":"\u00c9sik, Z., Kuich, W.: On iteration semiring-semimodule pairs. Semigroup Forum\u00a075, 129\u2013159 (2007)","journal-title":"Semigroup Forum"},{"key":"14_CR26","doi-asserted-by":"crossref","unstructured":"\u00c9sik, Z., Okawa, S.: On context-free languages of scattered words, arxiv: 1111.3439 (2011)","DOI":"10.1007\/978-3-642-31653-1_14"},{"key":"14_CR27","unstructured":"G\u00e9cseg, F., Steinby, M.: Tree Automata. Akad\u00e9miai Kiad\u00f3, Budapest (1984)"},{"key":"14_CR28","unstructured":"Golan, J.S.: The Theory of Semirings with Applications in Computer Science. Longman Scientific and Technical (1993)"},{"key":"14_CR29","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1016\/S0022-0000(71)80023-5","volume":"5","author":"J. Gruska","year":"1971","unstructured":"Gruska, J.: A characterization of context-free languages. J. Computer and System Sciences\u00a05, 353\u2013364 (1971)","journal-title":"J. Computer and System Sciences"},{"key":"14_CR30","first-page":"131","volume":"14","author":"S. Heilbrunner","year":"1980","unstructured":"Heilbrunner, S.: An algorithm for the solution of fixed-point equations for infinite words. Theoretical Informatics and Applications\u00a014, 131\u2013141 (1980)","journal-title":"Theoretical Informatics and Applications"},{"key":"14_CR31","unstructured":"Iv\u00e1n, S., M\u00e9sz\u00e1ros, \u00c1.: On Muller context-free grammars generating well-ordered words. In: Proc. Automata and Formal Languages, AFL 2011, Debrecen (2011)"},{"key":"14_CR32","doi-asserted-by":"publisher","first-page":"675","DOI":"10.1145\/1094622.1094625","volume":"6","author":"B. Khoussainov","year":"2005","unstructured":"Khoussainov, B., Rubin, S., Stephan, F.: Automatic linear orders and trees. ACM Transactions on Computational Logic (TOCL)\u00a06, 675\u2013700 (2005)","journal-title":"ACM Transactions on Computational Logic (TOCL)"},{"key":"14_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1007\/978-3-642-22012-8_16","volume-title":"Automata, Languages and Programming","author":"M. Lohrey","year":"2011","unstructured":"Lohrey, M., Mathissen, C.: Isomorphism of Regular Trees and Words. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011, Part II. LNCS, vol.\u00a06756, pp. 210\u2013221. Springer, Heidelberg (2011)"},{"key":"14_CR34","doi-asserted-by":"crossref","unstructured":"Muller, R.: Infinite sequences and finite machines. In: 4th Annual Symposium on Switching Circuit Theory and Logical Design, pp. 3\u201316. IEEE Computer Society (1963)","DOI":"10.1109\/SWCT.1963.8"},{"key":"14_CR35","doi-asserted-by":"crossref","unstructured":"Niwinski, D.: Fixed points vs. infinite generation. In: 3rd Ann. IEEE Symp. Logic in Comp. Sci., pp. 402\u2013409. IEEE Press (1988)","DOI":"10.1109\/LICS.1988.5137"},{"key":"14_CR36","first-page":"259","volume":"12","author":"M. Nivat","year":"1978","unstructured":"Nivat, M.: Sur les ensembles de mots infinis engendr\u00e9s par une grammaire alg\u00e9brique. Theoretical Informatics and Applications\u00a012, 259\u2013278 (1978) (French)","journal-title":"Theoretical Informatics and Applications"},{"key":"14_CR37","unstructured":"Perrin, D., Pin, J.-E.: Infinite Words. Elsevier (2004)"},{"key":"14_CR38","unstructured":"Rosenstein, J.G.: Linear Orderings. Academic Press (1982)"},{"key":"14_CR39","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1051\/ita\/1986200403711","volume":"20","author":"W. Thomas","year":"1986","unstructured":"Thomas, W.: On frontiers of regular sets. Theoretical Informatics and Applications\u00a020, 371\u2013381 (1986)","journal-title":"Theoretical Informatics and Applications"},{"key":"14_CR40","series-title":"Formal Models and Semantics","first-page":"133","volume-title":"Handbook of Theoretical Computer Science","author":"W. Thomas","year":"1990","unstructured":"Thomas, W.: Automata on infinite objects. In: van Leuwen, J. (ed.) Handbook of Theoretical Computer Science. Formal Models and Semantics, vol.\u00a0B, pp. 133\u2013192. Elsevier Science Publishers, Amsterdam (1990)"},{"key":"14_CR41","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\u00a07, 191\u2013223 (1984)","journal-title":"Fundamenta Informaticae"},{"key":"14_CR42","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\u00a08, 379\u2013396 (1985)","journal-title":"Fundamenta Informaticae"}],"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-31653-1_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,4]],"date-time":"2025-04-04T04:21:55Z","timestamp":1743740515000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31653-1_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642316524","9783642316531"],"references-count":42,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31653-1_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}