{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:12:29Z","timestamp":1759637549866,"version":"3.40.3"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319214993"},{"type":"electronic","value":"9783319215006"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-21500-6_14","type":"book-chapter","created":{"date-parts":[[2015,7,17]],"date-time":"2015-07-17T08:07:44Z","timestamp":1437120464000},"page":"179-190","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Transfinite Lyndon Words"],"prefix":"10.1007","author":[{"given":"Luc","family":"Boasson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Olivier","family":"Carton","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,7,18]]},"reference":[{"unstructured":"B\u00fcchi, J.R.: Transfinite automata recursions and weak second order theory of ordinals. In: Proc. Int. Congress Logic, Methodology, and Philosophy of Science, Jerusalem 1964, North Holland, pp. 2\u201323 (1965)","key":"14_CR1"},{"issue":"6","key":"14_CR2","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1051\/ita:2001102","volume":"35","author":"O Carton","year":"2001","unstructured":"Carton, O., Choffrut, C.: Periodicity and roots of transfinite strings. Theoret. Informatics and Applications 35(6), 525\u2013533 (2001)","journal-title":"Theoret. Informatics and Applications"},{"key":"14_CR3","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1051\/ita\/1980140201811","volume":"14","author":"JP Duval","year":"1980","unstructured":"Duval, J.P.: Mots de Lyndon et p\u00e9riodicit\u00e9. RAIRO Informat. Th\u00e9or. 14, 181\u2013191 (1980)","journal-title":"RAIRO Informat. Th\u00e9or."},{"unstructured":"Knuth, D.E.: Combinatorial Algorithms, The Art of Computer Programming. Addison-Wesley Professional, vol. 4A (2011)","key":"14_CR4"},{"key":"14_CR5","volume-title":"Combinatorics on Words, Encyclopedia of Mathematics and its Applications","author":"M Lothaire","year":"1983","unstructured":"Lothaire, M.: Combinatorics on Words, Encyclopedia of Mathematics and its Applications, vol. 17. Addison-Wesley, Reading (1983)"},{"key":"14_CR6","first-page":"202","volume":"77","author":"RC Lyndon","year":"1954","unstructured":"Lyndon, R.C.: On Burnside problem I. Trans. Am. Math. Soc. 77, 202\u2013215 (1954)","journal-title":"Trans. Am. Math. Soc."},{"key":"14_CR7","first-page":"329","volume":"78","author":"RC Lyndon","year":"1954","unstructured":"Lyndon, R.C.: On Burnside problem II. Trans. Am. Math. Soc. 78, 329\u2013332 (1954)","journal-title":"Trans. Am. Math. Soc."},{"key":"14_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/3-540-60922-9_13","volume-title":"STACS 96","author":"G Melan\u00e7on","year":"1996","unstructured":"Melan\u00e7on, G.: Lyndon factorization of infinite words. In: Puech, C., Reischuk, R. (eds.) STACS 96. LNCS, vol. 1046, pp. 147\u2013154. Springer, Heidelberg (1996)"},{"issue":"2","key":"14_CR9","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/S0020-0190(96)00147-0","volume":"60","author":"G Melan\u00e7on","year":"1996","unstructured":"Melan\u00e7on, G.: Viennot factorization of infinite words. Inf. Process. Lett. 60(2), 53\u201357 (1996)","journal-title":"Inf. Process. Lett."},{"key":"14_CR10","volume-title":"Linear Ordering","author":"JG Rosenstein","year":"1982","unstructured":"Rosenstein, J.G.: Linear Ordering. Academic Press, New York (1982)"},{"issue":"2","key":"14_CR11","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/0020-0190(94)90016-7","volume":"50","author":"R Siromoney","year":"1994","unstructured":"Siromoney, R., Mathew, L., Dare, V.R., Subramanian, K.G.: Infinite Lyndon words. Inf. Process. Lett. 50(2), 101\u2013104 (1994)","journal-title":"Inf. Process. Lett."}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-21500-6_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,15]],"date-time":"2023-02-15T13:12:23Z","timestamp":1676466743000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-21500-6_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319214993","9783319215006"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-21500-6_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"18 July 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}