{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:14:47Z","timestamp":1759637687187},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642223204"},{"type":"electronic","value":"9783642223211"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-22321-1_19","type":"book-chapter","created":{"date-parts":[[2011,7,14]],"date-time":"2011-07-14T23:58:48Z","timestamp":1310687928000},"page":"216-227","source":"Crossref","is-referenced-by-count":5,"title":["Scattered Context-Free Linear Orderings"],"prefix":"10.1007","author":[{"given":"Zolt\u00e1n","family":"\u00c9sik","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"19_CR1","doi-asserted-by":"crossref","unstructured":"Blum, N., Koch, R.: Greibach normal form transformation. Information and Computation\u00a0150, 112\u2013118 (1999) (revisited)","DOI":"10.1006\/inco.1998.2772"},{"key":"19_CR2","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":"19_CR3","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":"19_CR4","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 Informatic\u00e6\u00a099, 383\u2013407 (2010)","journal-title":"Fundamenta Informatic\u00e6"},{"key":"19_CR5","unstructured":"Bloom, S.L., \u00c9sik, Z.: Algebraic linear orderings. In: Int. J. Foundations of Computer Science (to appear)"},{"key":"19_CR6","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":"19_CR7","unstructured":"\u00c9sik, Z.: Algebraic and context-free linear orderings. Slides Presented at, Workshop on Higher-Order Recursion Schemes & Pushdown Automata, Paris, March 10\u201312 (2010), http:\/\/www.liafa.jussieu.fr\/~serre\/WorkshopSchemes\/"},{"key":"19_CR8","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":"19_CR9","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/j.ipl.2010.10.018","volume":"111","author":"Z. \u00c9sik","year":"2001","unstructured":"\u00c9sik, Z.: An undecidable property of context-free linear orders. Information Processing Letters\u00a0111, 107\u2013109 (2001)","journal-title":"Information Processing Letters"},{"key":"19_CR10","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":"19_CR11","unstructured":"Rosenstein, J.G.: Linear Orderings. Pure and Applied Mathematics, vol.\u00a098. Academic Press, New York (1982)"}],"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-22321-1_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,21]],"date-time":"2020-06-21T05:25:54Z","timestamp":1592717154000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22321-1_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642223204","9783642223211"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22321-1_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}