{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T11:43:37Z","timestamp":1743075817213,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030850876"},{"type":"electronic","value":"9783030850883"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-85088-3_14","type":"book-chapter","created":{"date-parts":[[2021,9,5]],"date-time":"2021-09-05T23:03:24Z","timestamp":1630883004000},"page":"160-171","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Characterization of Binary Morphisms Generating Lyndon Infinite Words"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2211-7448","authenticated-orcid":false,"given":"Gwena\u00ebl","family":"Richomme","sequence":"first","affiliation":[]},{"given":"Patrice","family":"S\u00e9\u00e9bold","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,9,6]]},"reference":[{"key":"14_CR1","doi-asserted-by":"crossref","unstructured":"Allouche, J.-P., Currie, J., Shallit, J.: Extremal infinite overlap-free binary words. Electron. J. Combin. 5(1), paper R27 (1998)","DOI":"10.37236\/1365"},{"key":"14_CR2","doi-asserted-by":"crossref","unstructured":"Berstel, J., Lauve, A., Reutenauer, C., Saliola, F.: Combinatorics on Words: Christoffel Words and Repetitions in Words. CRM Monograph Series, vol. 27. American Mathematical Society (2008)","DOI":"10.1090\/crmm\/027"},{"key":"14_CR3","doi-asserted-by":"publisher","first-page":"23","DOI":"10.5802\/jtnb.77","volume":"5","author":"JP Borel","year":"1993","unstructured":"Borel, J.P., Laubie, F.: Quelques mots sur la droite projective r\u00e9elle. J. Th\u00e9or. Nombres Bordeaux 5, 23\u201351 (1993)","journal-title":"J. Th\u00e9or. Nombres Bordeaux"},{"issue":"2","key":"14_CR4","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1142\/S0218196704001700","volume":"14","author":"J-M Champarnaud","year":"2004","unstructured":"Champarnaud, J.-M., Hansel, G., Perrin, D.: Unavoidable sets of constant length. Internat. J. Algebra Comput. 14(2), 241\u2013251 (2004)","journal-title":"Internat. J. Algebra Comput."},{"key":"14_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jcta.2014.07.008","volume":"128","author":"E Charlier","year":"2014","unstructured":"Charlier, E., Kamae, T., Puzynina, S., Zamboni, L.Q.: Infinite self-shuffling words. J. Combin. Theory Ser. A 128, 1\u201340 (2014)","journal-title":"J. Combin. Theory Ser. A"},{"issue":"68","key":"14_CR6","doi-asserted-by":"publisher","first-page":"81","DOI":"10.2307\/1970044","volume":"2","author":"KT Chen","year":"1958","unstructured":"Chen, K.T., Fox, R.H., Lyndon, R.C.: Free differential calculus IV - the quotient groups of the lower central series. Ann. Math. 2(68), 81\u201395 (1958)","journal-title":"Ann. Math."},{"issue":"4","key":"14_CR7","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1016\/0196-6774(83)90017-2","volume":"4","author":"J-P Duval","year":"1983","unstructured":"Duval, J.-P.: Factorizing words over an ordered alphabet. J. Algorithms 4(4), 363\u2013381 (1983)","journal-title":"J. Algorithms"},{"issue":"3","key":"14_CR8","doi-asserted-by":"publisher","first-page":"578","DOI":"10.1016\/j.tcs.2008.09.056","volume":"409","author":"A Glen","year":"2008","unstructured":"Glen, A., Lev\u00e9, F., Richomme, G.: Quasiperiodic and Lyndon episturmian words. Theoret. Comput. Sci. 409(3), 578\u2013600 (2008)","journal-title":"Theoret. Comput. Sci."},{"key":"14_CR9","unstructured":"Knuth, D.E.: Generating All Tuples and Permutations. The Art of Computer Programming, vol. 4, Fascicle 2. Addison-Wesley, Reading (2005)"},{"issue":"1","key":"14_CR10","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/j.tcs.2006.10.034","volume":"372","author":"F Lev\u00e9","year":"2007","unstructured":"Lev\u00e9, F., Richomme, G.: Quasiperiodic Sturmian words and morphisms. Theoret. Comput. Sci. 372(1), 15\u201325 (2007)","journal-title":"Theoret. Comput. Sci."},{"key":"14_CR11","series-title":"Encyclopedia of Mathematics and Its Applications","volume-title":"Combinatorics on Words","author":"M Lothaire","year":"1983","unstructured":"Lothaire, M.: Combinatorics on Words. Encyclopedia of Mathematics and Its Applications, vol. 17. Addison-Wesley, Boston (1983).Reprinted in the Cambridge Mathematical Library, Cambridge University Press, UK (1997)"},{"key":"14_CR12","series-title":"Encyclopedia of Mathematics and Its Applications","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107326019","volume-title":"Algebraic Combinatorics on Words","author":"M Lothaire","year":"2002","unstructured":"Lothaire, M.: Algebraic Combinatorics on Words. Encyclopedia of Mathematics and Its Applications, vol. 90. Cambridge University Press, Cambridge (2002)"},{"issue":"5","key":"14_CR13","first-page":"25","volume":"12","author":"G Paquin","year":"2010","unstructured":"Paquin, G.: A characterization of infinite smooth Lyndon words. Discrete Math. Theor. Comput. Sci. 12(5), 25\u201362 (2010)","journal-title":"Discrete Math. Theor. Comput. Sci."},{"key":"14_CR14","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1016\/j.tcs.2020.05.037","volume":"834","author":"M Postic","year":"2020","unstructured":"Postic, M., Zamboni, L.Q.: Reprint of: $$\\omega $$-Lyndon words. Theoret. Comput. Sci. 834, 60\u201365 (2020)","journal-title":"Theoret. Comput. Sci."},{"key":"14_CR15","volume-title":"From Christoffel Words to Markoff Numbers","author":"C Reutenauer","year":"2019","unstructured":"Reutenauer, C.: From Christoffel Words to Markoff Numbers. Oxford University Press, Oxford (2019)"},{"issue":"5","key":"14_CR16","doi-asserted-by":"publisher","first-page":"761","DOI":"10.36045\/bbms\/1074791331","volume":"10","author":"G Richomme","year":"2003","unstructured":"Richomme, G.: Lyndon morphisms. Bull. Belg. Math. Soc. Simon Stevin 10(5), 761\u2013786 (2003)","journal-title":"Bull. Belg. Math. Soc. Simon Stevin"},{"issue":"2","key":"14_CR17","first-page":"89","volume":"9","author":"G Richomme","year":"2007","unstructured":"Richomme, G.: On morphisms preserving infinite Lyndon words. Discret. Math. Theor. Comput. Sci. 9(2), 89\u2013108 (2007)","journal-title":"Discret. Math. Theor. Comput. Sci."},{"issue":"3","key":"14_CR18","doi-asserted-by":"publisher","first-page":"414","DOI":"10.1016\/0196-6774(92)90047-G","volume":"13","author":"F Ruskey","year":"1992","unstructured":"Ruskey, F., Savage, C., Wang, T.M.Y.: Generating necklaces. J. Algorithms 13(3), 414\u2013430 (1992)","journal-title":"J. Algorithms"},{"key":"14_CR19","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, 101\u2013104 (1994)","journal-title":"Inf. Process. Lett."}],"container-title":["Lecture Notes in Computer Science","Combinatorics on Words"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-85088-3_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,5]],"date-time":"2021-09-05T23:05:15Z","timestamp":1630883115000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-85088-3_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030850876","9783030850883"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-85088-3_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"6 September 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WORDS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Combinatorics on Words","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 September 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cwords2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/words2021.sciencesconf.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"18","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"11","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"61% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2 invited papers are also included","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}