{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T02:51:56Z","timestamp":1742957516309,"version":"3.40.3"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030287955"},{"type":"electronic","value":"9783030287962"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-28796-2_11","type":"book-chapter","created":{"date-parts":[[2019,9,1]],"date-time":"2019-09-01T23:02:43Z","timestamp":1567378963000},"page":"145-158","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The Undirected Repetition Threshold"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0061-3849","authenticated-orcid":false,"given":"James D.","family":"Currie","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4295-0632","authenticated-orcid":false,"given":"Lucas","family":"Mol","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,8,9]]},"reference":[{"key":"11_CR1","unstructured":"Berstel, J.: Axel Thue\u2019s papers on repetitions in words: a translation. In: Publications du LaCIM, vol. 20. Universit\u00e9 du Qu\u00e9bec \u00e0 Montr\u00e9al (1995)"},{"issue":"1","key":"11_CR2","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/0304-3975(88)90009-6","volume":"23","author":"FJ Brandenburg","year":"1983","unstructured":"Brandenburg, F.J.: Uniformly growing $$k$$-th power-free homomorphisms. Theoret. Comput. Sci. 23(1), 69\u201382 (1983)","journal-title":"Theoret. Comput. Sci."},{"issue":"1\u20133","key":"11_CR3","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(1\u20133), 137\u2013151 (2007)","journal-title":"Theoret. Comput. Sci."},{"key":"11_CR4","first-page":"111","volume-title":"Algebraic Combinatorics on Words","author":"J Cassaigne","year":"2002","unstructured":"Cassaigne, J.: Unavoidable patterns. In: Lothaire, M. (ed.) Algebraic Combinatorics on Words, pp. 111\u2013134. Cambridge University Press, Cambridge (2002)"},{"issue":"8","key":"11_CR5","doi-asserted-by":"publisher","first-page":"725","DOI":"10.1006\/eujc.1999.0329","volume":"20","author":"J Cassaigne","year":"1999","unstructured":"Cassaigne, J., Currie, J.D.: Words strongly avoiding fractional powers. Eur. J. Combin. 20(8), 725\u2013737 (1999)","journal-title":"Eur. J. Combin."},{"key":"11_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/978-3-319-30000-9_19","volume-title":"Language and Automata Theory and Applications","author":"M Crochemore","year":"2016","unstructured":"Crochemore, M., Kolpakov, R., Kucherov, G.: Optimal bounds for computing $$\\alpha $$-gapped repeats. In: Dediu, A.-H., Janou\u0161ek, J., Mart\u00edn-Vide, C., Truthe, B. (eds.) LATA 2016. LNCS, vol. 9618, pp. 245\u2013255. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-30000-9_19"},{"issue":"1","key":"11_CR7","doi-asserted-by":"crossref","first-page":"P1.36","DOI":"10.37236\/5483","volume":"23","author":"JD Currie","year":"2016","unstructured":"Currie, J.D., Lafrance, P.: Avoidability index for binary patterns with reversal. Electron. J. Combin. 23(1), P1.36 (2016)","journal-title":"Electron. J. Combin."},{"issue":"4","key":"11_CR8","doi-asserted-by":"publisher","first-page":"696","DOI":"10.4153\/CJM-2001-028-4","volume":"53","author":"JD Currie","year":"2001","unstructured":"Currie, J.D., Linek, V.: Avoiding patterns in the Abelian sense. Canad. J. Math. 53(4), 696\u2013714 (2001)","journal-title":"Canad. J. Math."},{"issue":"3","key":"11_CR9","doi-asserted-by":"publisher","first-page":"432","DOI":"10.1016\/j.tcs.2008.08.039","volume":"409","author":"JD Currie","year":"2008","unstructured":"Currie, J.D., Visentin, T.I.: Long binary patterns are Abelian 2-avoidable. Theor. Comput. Sci. 409(3), 432\u2013437 (2008)","journal-title":"Theor. Comput. Sci."},{"issue":"5","key":"11_CR10","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1142\/S0218196717500242","volume":"27","author":"JD Currie","year":"2017","unstructured":"Currie, J.D., Mol, L., Rampersad, N.: A family of formulas with reversal of high avoidability index. Int. J. Algebra Comput. 27(5), 477\u2013493 (2017)","journal-title":"Int. J. Algebra Comput."},{"key":"11_CR11","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/j.tcs.2018.04.039","volume":"738","author":"JD Currie","year":"2018","unstructured":"Currie, J.D., Mol, L., Rampersad, N.: Avoidance bases for formulas with reversal. Theor. Comput. Sci. 738, 25\u201341 (2018)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"11_CR12","doi-asserted-by":"publisher","first-page":"775","DOI":"10.1051\/ita\/2009017","volume":"43","author":"JD Currie","year":"2009","unstructured":"Currie, J.D., Rampersad, N.: Dejean\u2019s conjecture holds for $$n\\ge 27$$. RAIRO - Theor. Inform. Appl. 43(4), 775\u2013778 (2009)","journal-title":"RAIRO - Theor. Inform. Appl."},{"issue":"274","key":"11_CR13","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. Comput. 80(274), 1063\u20131070 (2011)","journal-title":"Math. Comput."},{"key":"11_CR14","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"},{"issue":"2","key":"11_CR15","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/0097-3165(79)90044-X","volume":"27","author":"FM Dekking","year":"1979","unstructured":"Dekking, F.M.: Strongly non-repetitive sequences and progression-free sets. J. Combin. Theory Ser. A 27(2), 181\u2013185 (1979)","journal-title":"J. Combin. Theory Ser. A"},{"key":"11_CR16","unstructured":"Duchon, P., Nicaud, C., Pivoteau, C.: Gapped pattern statistics. In: 28th Annual Symposium on Combinatorial Pattern Matching (CPM 2017), pp. 21:1\u201321:12 (2017)"},{"key":"11_CR17","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1016\/j.tcs.2016.04.039","volume":"635","author":"G Fici","year":"2016","unstructured":"Fici, G., Langiu, A., Lecroq, T., Lefebvre, A., Mignosi, F., Peltom\u00e4ki, J., Prieur-Gaston, \u00c9.: Abelian powers and repetitions in Sturmian words. Theor. Comput. Sci. 635, 16\u201334 (2016)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"11_CR18","first-page":"357","volume":"4","author":"AE Frid","year":"2001","unstructured":"Frid, A.E.: Overlap-free symmetric D0L words. Discret. Math. Theor. Comput. Sci. 4(2), 357\u2013362 (2001)","journal-title":"Discret. Math. Theor. Comput. Sci."},{"key":"11_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/978-3-319-22177-9_3","volume-title":"Fundamentals of Computation Theory","author":"P Gawrychowski","year":"2015","unstructured":"Gawrychowski, P., Manea, F.: Longest $$\\alpha $$-gapped repeat and palindrome. In: Kosowski, A., Walukiewicz, I. (eds.) FCT 2015. LNCS, vol. 9210, pp. 27\u201340. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-22177-9_3"},{"key":"11_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2018.06.033","volume":"753","author":"I Tomohiro","year":"2019","unstructured":"Tomohiro, I., K\u00f6ppl, D.: Improved upper bounds on all maximal $$\\alpha $$-gapped repeats and palindromes. Theor. Comput. Sci. 753, 1\u201315 (2019)","journal-title":"Theor. Comput. Sci."},{"key":"11_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/3-540-55719-9_62","volume-title":"Automata, Languages and Programming","author":"V Ker\u00e4nen","year":"1992","unstructured":"Ker\u00e4nen, V.: Abelian squares are avoidable on 4 letters. In: Kuich, W. (ed.) ICALP 1992. LNCS, vol. 623, pp. 41\u201352. Springer, Heidelberg (1992). https:\/\/doi.org\/10.1007\/3-540-55719-9_62"},{"issue":"3","key":"11_CR22","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. Eur. J. Combin. 28(3), 876\u2013890 (2007)","journal-title":"Eur. J. Combin."},{"issue":"2","key":"11_CR23","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. Theor. Comput. Sci. 95(2), 187\u2013205 (1992)","journal-title":"Theor. Comput. Sci."},{"key":"11_CR24","unstructured":"Mousavi, H.: Automatic theorem proving in Walnut. Preprint, arXiv: 1603.06017 [cs.FL] (2016)"},{"issue":"3","key":"11_CR25","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/0166-218X(84)90006-4","volume":"7","author":"JJ Pansiot","year":"1984","unstructured":"Pansiot, J.J.: A propos d\u2019une conjecture de F. Dejean sur les r\u00e9p\u00e9titions dans les mots. Discret. Appl. Math. 7(3), 297\u2013311 (1984)","journal-title":"Discret. Appl. Math."},{"issue":"27","key":"11_CR26","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. Theor. Comput. Sci. 412(27), 3010\u20133018 (2011)","journal-title":"Theor. Comput. Sci."},{"key":"11_CR27","unstructured":"Rosenfeld, M.: Every binary pattern of length greater than 14 is Abelian-2-avoidable. In: 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016), pp. 81:1\u201381:11 (2016)"},{"issue":"1","key":"11_CR28","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1051\/ita\/2011127","volume":"46","author":"AV Samsonov","year":"2012","unstructured":"Samsonov, A.V., Shur, A.M.: On Abelian repetition threshold. RAIRO - Theor. Inform. Appl. 46(1), 147\u2013163 (2012)","journal-title":"RAIRO - Theor. Inform. Appl."},{"issue":"7","key":"11_CR29","doi-asserted-by":"publisher","first-page":"1683","DOI":"10.1142\/S0129054111008969","volume":"22","author":"AM Shur","year":"2011","unstructured":"Shur, A.M.: On the existence of minimal $$\\beta $$-powers. Int. J. Found. Comput. Sci. 22(7), 1683\u20131696 (2011)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"2","key":"11_CR30","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/s00224-013-9512-x","volume":"54","author":"AM Shur","year":"2014","unstructured":"Shur, A.M.: Growth of power-free languages over large alphabets. Theor. Comput. Syst. 54(2), 224\u2013243 (2014)","journal-title":"Theor. Comput. Syst."}],"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-28796-2_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T13:18:52Z","timestamp":1710249532000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-28796-2_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030287955","9783030287962"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-28796-2_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"9 August 2019","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":"Loughborough","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 September 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cwords2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/words2019.lboro.ac.uk\/","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":"34","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":"21","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":"62% - 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":"7","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)"}}]}}