{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,8]],"date-time":"2025-04-08T04:27:31Z","timestamp":1744086451056,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642334740"},{"type":"electronic","value":"9783642334757"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-33475-7_8","type":"book-chapter","created":{"date-parts":[[2012,9,8]],"date-time":"2012-09-08T06:43:09Z","timestamp":1347086589000},"page":"104-118","source":"Crossref","is-referenced-by-count":1,"title":["A Context-Free Linear Ordering with an Undecidable First-Order Theory"],"prefix":"10.1007","author":[{"given":"Arnaud","family":"Carayol","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zolt\u00e1n","family":"\u00c9sik","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"8_CR1","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":"8_CR2","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":"8_CR3","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":"8_CR4","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":"8_CR5","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":"8_CR6","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":"8_CR7","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":"8_CR8","unstructured":"Carayol, A., \u00c9sik, Z.: The FC-rank of a context-free language (to appear)"},{"key":"8_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1007\/978-3-540-24597-1_10","volume-title":"FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science","author":"A. Carayol","year":"2003","unstructured":"Carayol, A., W\u00f6hrle, S.: The Caucal Hierarchy of Infinite Graphs in Terms of Logic and Higher-Order Pushdown Automata. In: Pandya, P.K., Radhakrishnan, J. (eds.) FSTTCS 2003. LNCS, vol.\u00a02914, pp. 112\u2013123. Springer, Heidelberg (2003)"},{"key":"8_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/3-540-45687-2_13","volume-title":"Mathematical Foundations of Computer Science 2002","author":"D. Caucal","year":"2002","unstructured":"Caucal, D.: On Infinite Terms Having a Decidable Monadic Theory. In: Diks, K., Rytter, W. (eds.) MFCS 2002. LNCS, vol.\u00a02420, pp. 165\u2013176. Springer, Heidelberg (2002)"},{"key":"8_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 transition graphs having a decidable monadic theory. Theoretical Computer Science\u00a0290, 79\u2013115 (2003)","journal-title":"Theoretical Computer Science"},{"key":"8_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":"8_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":"8_CR14","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":"8_CR15","doi-asserted-by":"crossref","unstructured":"\u00c9sik, Z.: Representing small ordinals by finite automata. In: 12th Workshop Descriptional Complexity of Formal Systems, Saskatoon, Canada. EPTCS, vol.\u00a031, pp. 78\u201387 (2010)","DOI":"10.4204\/EPTCS.31.10"},{"key":"8_CR16","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":"8_CR17","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":"8_CR18","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":"8_CR19","doi-asserted-by":"crossref","unstructured":"Hague, M., Murawski, A., Ong, C.-H.L., Serre, O.: Collapsible Pushdown Automata and Recursion Schemes. In: LICS 2008, pp. 452\u2013461. IEEE (2008)","DOI":"10.1109\/LICS.2008.34"},{"key":"8_CR20","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":"8_CR21","unstructured":"Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley (1979)"},{"key":"8_CR22","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":"8_CR23","unstructured":"Lohrey, M.: Private communication (2012)"},{"key":"8_CR24","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":"8_CR25","doi-asserted-by":"crossref","unstructured":"Luke Ong, C.-H.: On model-checking trees generated by higher-order recursion schemes. In: LICS 2006, pp. 81\u201390. IEEE Press (2006)","DOI":"10.1109\/LICS.2006.38"},{"key":"8_CR26","unstructured":"Parys, P.: Higher-order stacks can not replace nondeterminism. Note published on the authors webpage (3 p.) (February 2010)"},{"key":"8_CR27","unstructured":"Rosenstein, J.G.: Linear Orderings. Pure and Applied Mathematics, vol.\u00a098. Academic Press (1982)"},{"key":"8_CR28","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"}],"container-title":["Lecture Notes in Computer Science","Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33475-7_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,8]],"date-time":"2025-04-08T01:50:35Z","timestamp":1744077035000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33475-7_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642334740","9783642334757"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33475-7_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}