{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T23:32:48Z","timestamp":1743031968224,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031331794"},{"type":"electronic","value":"9783031331800"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-33180-0_10","type":"book-chapter","created":{"date-parts":[[2023,5,30]],"date-time":"2023-05-30T23:03:27Z","timestamp":1685487807000},"page":"130-142","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Critical Exponents of\u00a0Regular Arnoux-Rauzy Sequences"],"prefix":"10.1007","author":[{"given":"L\u2019ubom\u00edra","family":"Dvo\u0159\u00e1kov\u00e1","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jana","family":"Lep\u0161ov\u00e1","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,5,31]]},"reference":[{"issue":"04","key":"10_CR1","doi-asserted-by":"publisher","first-page":"689","DOI":"10.1142\/S0218196713400043","volume":"23","author":"V Berth\u00e9","year":"2013","unstructured":"Berth\u00e9, V., Cassaigne, J., Steiner, W.: Balance properties of Arnoux-Rauzy sequences. Int. J. Algebra Comput. 23(04), 689\u2013703 (2013)","journal-title":"Int. J. Algebra Comput."},{"issue":"12","key":"10_CR2","doi-asserted-by":"publisher","first-page":"983","DOI":"10.1007\/PL00013299","volume":"36","author":"A Carpi","year":"2000","unstructured":"Carpi, A., de Luca, A.: Special factors, periodicity, and an application to Sturmian words. Acta Inf. 36(12), 983\u20131006 (2000)","journal-title":"Acta Inf."},{"key":"10_CR3","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1007\/BF01762232","volume":"7","author":"EM Coven","year":"1973","unstructured":"Coven, E.M., Hedlund, G.A.: Sequences with minimal block growth. Math. Syst. Theor. 7, 138\u2013153 (1973)","journal-title":"Math. Syst. Theor."},{"key":"10_CR4","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1016\/0097-3165(72)90011-8","volume":"13","author":"F Dejean","year":"1972","unstructured":"Dejean, F.: Sur un th\u00e9or\u00e8me de Thue. J. Combin. Theory. Ser. A 13, 90\u201399 (1972)","journal-title":"J. Combin. Theory. Ser. A"},{"key":"10_CR5","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/S0012-365X(97)00029-0","volume":"179","author":"F Durand","year":"1998","unstructured":"Durand, F.: A characterization of substitutive sequences using return words. Discrete Math. 179, 89\u2013101 (1998)","journal-title":"Discrete Math."},{"key":"10_CR6","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/j.tcs.2007.04.037","volume":"381","author":"D Krieger","year":"2007","unstructured":"Krieger, D., Shallit, J.O.: Every real number greater than 1 is a critical exponent. Theoret. Comput. Sci. 381, 177\u2013182 (2007)","journal-title":"Theoret. Comput. Sci."},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"Pansiot, J.-J.: A propos d\u2019une conjecture de F. Dejean sur les r\u00e9p\u00e9titions dans les mots. Discr. Appl. Math. 7(1), 297\u2013311 (1984)","DOI":"10.1016\/0166-218X(84)90006-4"},{"key":"10_CR8","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/0304-3975(92)90264-G","volume":"95","author":"J Moulin-Ollagnier","year":"1992","unstructured":"Moulin-Ollagnier, J.: Proof of Dejean\u2019s conjecture for alphabets with $$5,6,7,8,9,10$$ and $$11$$ letters. Theoret. Comput. Sci. 95, 187\u2013205 (1992)","journal-title":"Theoret. Comput. Sci."},{"key":"10_CR9","doi-asserted-by":"publisher","first-page":"876","DOI":"10.1016\/j.ejc.2005.11.005","volume":"28","author":"M Mohammad-Noori","year":"2007","unstructured":"Mohammad-Noori, M., Currie, J.D.: Dejean\u2019s conjecture and Sturmian words. European J. Comb. 28, 876\u2013890 (2007)","journal-title":"European J. Comb."},{"issue":"1\u20132","key":"10_CR10","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/S0304-3975(98)00202-3","volume":"242","author":"P Hubert","year":"2000","unstructured":"Hubert, P.: Suites \u00e9quilibr\u00e9es. Theoret. Comput. Sci. 242(1\u20132), 91\u2013108 (2000)","journal-title":"Theoret. Comput. Sci."},{"key":"10_CR11","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/j.tcs.2007.06.001","volume":"385","author":"A Carpi","year":"2007","unstructured":"Carpi, A.: On Dejean\u2019s conjecture over large alphabets. Theoret. Comput. Sci. 385, 137\u2013151 (2007)","journal-title":"Theoret. Comput. Sci."},{"key":"10_CR12","doi-asserted-by":"publisher","first-page":"1063","DOI":"10.1090\/S0025-5718-2010-02407-X","volume":"80","author":"JD Currie","year":"2011","unstructured":"Currie, J.D., Rampersad, N.: A proof of Dejean\u2019s conjecture. Math. Comp. 80, 1063\u20131070 (2011)","journal-title":"Math. Comp."},{"key":"10_CR13","doi-asserted-by":"publisher","first-page":"3010","DOI":"10.1016\/j.tcs.2010.06.020","volume":"412","author":"M Rao","year":"2011","unstructured":"Rao, M.: Last cases of Dejean\u2019s conjecture. Theoret. Comput. Sci. 412, 3010\u20133018 (2011)","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"10_CR14","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1016\/S0304-3975(99)00320-5","volume":"255","author":"X Droubay","year":"2001","unstructured":"Droubay, X., Justin, J., Pirillo, G.: Episturmian words and some constructions of de Luca and Rauzy. Theoret. Comput. Sci. 255(1), 539\u2013553 (2001)","journal-title":"Theoret. Comput. Sci."},{"key":"10_CR15","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1006\/eujc.2000.0496","volume":"23","author":"D Damanik","year":"2002","unstructured":"Damanik, D., Lenz, D.: The index of Sturmian sequences. J. Eur. J. Comb. 23, 23\u201329 (2002)","journal-title":"J. Eur. J. Comb."},{"key":"10_CR16","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/S0304-3975(01)00207-9","volume":"276","author":"J Justin","year":"2002","unstructured":"Justin, J., Pirillo, G.: Episturmian words and episturmian morphisms. Theoret. Comput. Sci. 276, 281\u2013313 (2002)","journal-title":"Theoret. Comput. Sci."},{"key":"10_CR17","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1016\/j.tcs.2007.03.023","volume":"380","author":"A Glen","year":"2007","unstructured":"Glen, A.: Powers in a class of A-strict standard episturmian words. Theoret. Comput. Sci. 380, 330\u2013354 (2007)","journal-title":"Theoret. Comput. Sci."},{"key":"10_CR18","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1051\/ita:2000121","volume":"34","author":"J Justin","year":"2000","unstructured":"Justin, J., Vuillon, L.: Return words in Sturmian and episturmian words. RAIRO-Theoret. Inf. Appl. 34, 343\u2013356 (2000)","journal-title":"RAIRO-Theoret. Inf. Appl."},{"key":"10_CR19","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1016\/j.tcs.2022.10.014","volume":"939","author":"F Dolce","year":"2023","unstructured":"Dolce, F., Dvo\u0159\u00e1kov\u00e1, L., Pelantov\u00e1, E.: On balanced sequences and their critical exponent. Theoret. Comput. Sci. 939, 18\u201347 (2023)","journal-title":"Theoret. Comput. Sci."},{"key":"10_CR20","unstructured":"Peltom\u00e4ki, J.: Initial nonrepetitive complexity of regular episturmian words and their Diophantine exponents. arXiv (2021) https:\/\/arxiv.org\/abs\/2103.08351"},{"key":"10_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/978-3-030-28796-2_20","volume-title":"Combinatorics on Words","author":"K Medkov\u00e1","year":"2019","unstructured":"Medkov\u00e1, K.: Derived sequences of Arnoux\u2013Rauzy sequences. In: Merca\u015f, R., Reidenbach, D. (eds.) WORDS 2019. LNCS, vol. 11682, pp. 251\u2013263. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-28796-2_20"},{"key":"10_CR22","unstructured":"SageMath package. https:\/\/pypi.org\/project\/colored-arnoux-rauzy-sequences\/ Last Accessed 14 Feb 2023"},{"issue":"6","key":"10_CR23","doi-asserted-by":"publisher","first-page":"1703","DOI":"10.1016\/j.ejc.2006.07.007","volume":"28","author":"B Tan","year":"2007","unstructured":"Tan, B., Wen, Z.-Y.: Some properties of the Tribonacci sequence. Eur. J. Comb. 28(6), 1703\u20131719 (2007)","journal-title":"Eur. J. Comb."},{"key":"10_CR24","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. Cambridge University Press, Cambridge (2002)"}],"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-031-33180-0_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,30]],"date-time":"2023-05-30T23:04:46Z","timestamp":1685487886000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-33180-0_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031331794","9783031331800"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-33180-0_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"31 May 2023","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":"Ume\u00e5","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sweden","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 June 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 June 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cwords2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/dltwords2023.cs.umu.se\/","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":"Easy chair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"28","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":"19","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":"0","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":"68% - 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":"2.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":"5","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":"3 Invited papers included in this proceedings","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)"}}]}}