{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T19:40:06Z","timestamp":1742931606978,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642293436"},{"type":"electronic","value":"9783642293443"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-29344-3_25","type":"book-chapter","created":{"date-parts":[[2012,4,10]],"date-time":"2012-04-10T14:19:29Z","timestamp":1334067569000},"page":"291-302","source":"Crossref","is-referenced-by-count":3,"title":["Hausdorff Rank of Scattered Context-Free Linear Orders"],"prefix":"10.1007","author":[{"given":"Zolt\u00e1n","family":"\u00c9sik","sequence":"first","affiliation":[]},{"given":"Szabolcs","family":"Iv\u00e1n","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"25_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1007\/978-3-540-79709-8_11","volume-title":"CSR 2008","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":"25_CR2","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":"25_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/978-3-642-14162-1_8","volume-title":"Automata, Languages and Programming","author":"L. Braud","year":"2010","unstructured":"Braud, L., Carayol, A.: Linear Orders in the Pushdown Hierarchy. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010. LNCS, vol.\u00a06199, pp. 88\u201399. Springer, Heidelberg (2010)"},{"key":"25_CR4","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 omega-power. Theoretical Computer Science\u00a0259, 533\u2013548 (2001)","journal-title":"Theoretical Computer Science"},{"key":"25_CR5","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. Fundamenta Informaticae\u00a055, 1\u201321 (2003)","journal-title":"Fundamenta Informaticae"},{"key":"25_CR6","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":"25_CR7","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":"25_CR8","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":"25_CR9","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":"25_CR10","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":"25_CR11","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/S0304-3975(01)00089-5","volume":"290","author":"D. Caucal","year":"2003","unstructured":"Caucal, D.: On infinite graphs having a decidable monadic theory. Theoretical Computer Science\u00a0290, 79\u2013115 (2003)","journal-title":"Theoretical Computer Science"},{"key":"25_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":"25_CR13","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/0304-3975(83)90059-2","volume":"25","author":"B. Courcelle","year":"1983","unstructured":"Courcelle, B.: Fundamental properties of infinite trees. Theoretical Computer Science\u00a025, 95\u2013169 (1983)","journal-title":"Theoretical Computer Science"},{"key":"25_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1007\/3-540-08342-1_13","volume-title":"Automata, Languages and Programming","author":"W. Damm","year":"1977","unstructured":"Damm, W.: Languages Defined by Higher Type Program Schemes. In: Salomaa, A., Steinby, M. (eds.) ICALP 1977. LNCS, vol.\u00a052, pp. 164\u2013179. Springer, Heidelberg (1977)"},{"key":"25_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1007\/3-540-09526-8_23","volume-title":"Mathematical Foundations of Computer Science 1979","author":"W. Damm","year":"1979","unstructured":"Damm, W.: An Algebraic Extension of the Chomsky-Hierarchy. In: Becvar, J. (ed.) MFCS 1979. LNCS, vol.\u00a074, pp. 266\u2013276. Springer, Heidelberg (1979)"},{"key":"25_CR16","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/j.crma.2004.03.035","volume":"339","author":"C. Delhomm\u00e9","year":"2004","unstructured":"Delhomm\u00e9, C.: Automaticit\u00e9 des ordinaux et des graphes homog\u00e8nes. C. R. Acad. Sci. Paris, Ser. I\u00a0339, 5\u201310 (2004)","journal-title":"C. R. Acad. Sci. Paris, Ser. I"},{"key":"25_CR17","doi-asserted-by":"crossref","unstructured":"\u00c9sik, Z.: Representing small ordinals by finite automata. In: Proc. 12th Workshop Descriptional Complexity of Formal Systems, Saskatoon, Canada. EPTCS, vol.\u00a031, pp. 78\u201387 (2010)","DOI":"10.4204\/EPTCS.31.10"},{"key":"25_CR18","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/j.ipl.2010.10.018","volume":"111","author":"Z. \u00c9sik","year":"2010","unstructured":"\u00c9sik, Z.: An undecidable property of context-free linear orders. Information Processing Letters\u00a0111, 107\u2013109 (2010)","journal-title":"Information Processing Letters"},{"key":"25_CR19","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":"25_CR20","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":"25_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/978-3-642-14455-4_17","volume-title":"Developments in Language Theory","author":"Z. \u00c9sik","year":"2010","unstructured":"\u00c9sik, Z., Iv\u00e1n, S.: On M\u00fcller Context-Free Grammars. In: Gao, Y., Lu, H., Seki, S., Yu, S. (eds.) DLT 2010. LNCS, vol.\u00a06224, pp. 173\u2013184. Springer, Heidelberg (2010)"},{"key":"25_CR22","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":"25_CR23","doi-asserted-by":"crossref","unstructured":"Khoussainov, B., Rubin, S., Stephan, F.: On automatic partial orders, in. In: Eighteenth IEEE Symposium on Logic in Computer Science, LICS, pp. 168\u2013177. IEEE Press (2003)","DOI":"10.1109\/LICS.2003.1210056"},{"key":"25_CR24","doi-asserted-by":"publisher","first-page":"625","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 Trans. Comput. Log.\u00a06, 625\u2013700 (2005)","journal-title":"ACM Trans. Comput. Log."},{"key":"25_CR25","doi-asserted-by":"crossref","unstructured":"Kuske, D., Liu, J., Lohrey, M.: The isomorphism problem on classes of automatic structures. In: LICS 2010, pp. 160\u2013169. IEEE Computer Society (2010)","DOI":"10.1109\/LICS.2010.10"},{"key":"25_CR26","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":"25_CR27","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511566097","volume-title":"Combinatorics on Words","author":"M. Lothaire","year":"1997","unstructured":"Lothaire, M.: Combinatorics on Words. Cambridge University Press, Cambridge (1997)"},{"key":"25_CR28","unstructured":"Rosenstein, J.G.: Linear Orderings. Pure and Applied Mathematics, vol.\u00a098. Academic Press (1982)"},{"key":"25_CR29","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 trees. Theoretical Informatics and Applications\u00a020, 371\u2013381 (1986)","journal-title":"Theoretical Informatics and Applications"},{"key":"25_CR30","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1112\/plms\/s3-4.1.177","volume":"3","author":"G.H. Toulmin","year":"1954","unstructured":"Toulmin, G.H.: Shuffling ordinals and transfinite dimension. Proc. London Math. Soc.\u00a03, 177\u2013195 (1954)","journal-title":"Proc. London Math. Soc."}],"container-title":["Lecture Notes in Computer Science","LATIN 2012: Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-29344-3_25.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T18:31:30Z","timestamp":1742927490000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-29344-3_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642293436","9783642293443"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-29344-3_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}