{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T17:35:55Z","timestamp":1725730555318},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642387708"},{"type":"electronic","value":"9783642387715"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38771-5_20","type":"book-chapter","created":{"date-parts":[[2013,6,10]],"date-time":"2013-06-10T02:16:25Z","timestamp":1370830585000},"page":"215-226","source":"Crossref","is-referenced-by-count":0,"title":["Operational Characterization of Scattered MCFLs"],"prefix":"10.1007","author":[{"given":"Zolt\u00e1n","family":"\u00c9sik","sequence":"first","affiliation":[]},{"given":"Szabolcs","family":"Iv\u00e1n","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"20_CR1","unstructured":"de Bakker, J.W., Scott, D.: A theory of programs. IBM Seminar Vienna (August 1969)"},{"key":"20_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":"20_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.) Computer Science \u2013 Theory and Applications. LNCS, vol.\u00a05010, pp. 76\u201385. Springer, Heidelberg (2008)"},{"key":"20_CR4","unstructured":"Beki\u0107, H.: Definable operations in general algebras, and the theory of automata and flowcharts. IBM Seminar Vienna (December 1969)"},{"key":"20_CR5","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":"20_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":"20_CR7","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":"20_CR8","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":"20_CR9","series-title":"Lecture Notes in Math","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. Lecture Notes in Math, vol.\u00a0328, pp. 1\u2013127. Springer, Heidelberg (1973)"},{"issue":"1","key":"20_CR10","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":"20_CR11","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":"20_CR12","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":"20_CR13","unstructured":"\u00c9sik, Z., Iv\u00e1n, S.: Operational characterization of scattered MCFLs. arXiv:1304.6388 [cs.FL]"},{"key":"20_CR14","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)","journal-title":"Theoretical Computer Science"},{"key":"20_CR15","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 Muller context-free grammars. Theoretical Computer Science\u00a0416, 17\u201332 (2012)","journal-title":"Theoretical Computer Science"},{"key":"20_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/978-3-642-29344-3_25","volume-title":"LATIN 2012: Theoretical Informatics","author":"Z. \u00c9sik","year":"2012","unstructured":"\u00c9sik, Z., Iv\u00e1n, S.: Hausdorff rank of scattered context-free linear orders. In: Fern\u00e1ndez-Baca, D. (ed.) LATIN 2012. LNCS, vol.\u00a07256, pp. 291\u2013302. Springer, Heidelberg (2012)"},{"key":"20_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1007\/978-3-642-31653-1_14","volume-title":"Developments in Language Theory","author":"Z. \u00c9sik","year":"2012","unstructured":"\u00c9sik, Z., Okawa, S.: On context-free languages of scattered words. In: Yen, H.-C., Ibarra, O.H. (eds.) DLT 2012. LNCS, vol.\u00a07410, pp. 142\u2013153. Springer, Heidelberg (2012)"},{"key":"20_CR18","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":"20_CR19","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":"20_CR20","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 (French). Theoretical Informatics and Applications\u00a012, 259\u2013278 (1978)","journal-title":"Theoretical Informatics and Applications"},{"key":"20_CR21","unstructured":"Perrin, D., Pin, J.-E.: Infinite Words. Elsevier (2004)"},{"key":"20_CR22","unstructured":"Rosenstein, J.G.: Linear Orderings. Academic Press (1982)"},{"key":"20_CR23","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":"20_CR24","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-38771-5_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,24]],"date-time":"2022-02-24T15:21:49Z","timestamp":1645716109000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38771-5_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642387708","9783642387715"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38771-5_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}