{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T23:13:14Z","timestamp":1743030794482,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031332630"},{"type":"electronic","value":"9783031332647"}],"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-33264-7_18","type":"book-chapter","created":{"date-parts":[[2023,5,18]],"date-time":"2023-05-18T08:03:26Z","timestamp":1684397006000},"page":"219-232","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Approaching Repetition Thresholds via\u00a0Local Resampling and\u00a0Entropy Compression"],"prefix":"10.1007","author":[{"given":"Arseny M.","family":"Shur","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,5,19]]},"reference":[{"key":"18_CR1","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/j.tcs.2007.06.001","volume":"385","author":"A Carpi","year":"1999","unstructured":"Carpi, A.: On Dejean\u2019s conjecture over large alphabets. Theoret. Comput. Sci. 385, 137\u2013151 (1999)","journal-title":"Theoret. Comput. Sci."},{"key":"18_CR2","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":"18_CR3","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1016\/j.tcs.2021.03.010","volume":"866","author":"JD Currie","year":"2021","unstructured":"Currie, J.D., Mol, L.: The undirected repetition threshold and undirected pattern avoidance. Theor. Comput. Sci. 866, 56\u201369 (2021)","journal-title":"Theor. Comput. Sci."},{"key":"18_CR4","unstructured":"Cvetkovi\u0107, D.M., Doob, M., Sachs, H.: Spectra of graphs, 3rd edn. Theory and applications. Johann Ambrosius Barth, Heidelberg (1995)"},{"key":"18_CR5","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":"8","key":"18_CR6","doi-asserted-by":"publisher","first-page":"1583","DOI":"10.1142\/S0129054112400631","volume":"23","author":"IA Gorbunova","year":"2012","unstructured":"Gorbunova, I.A., Shur, A.M.: On Pansiot words avoiding 3-repetitions. Int. J. Found. Comput. Sci. 23(8), 1583\u20131594 (2012)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"2","key":"18_CR7","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1002\/rsa.20411","volume":"42","author":"J Grytczuk","year":"2013","unstructured":"Grytczuk, J., Kozik, J., Micek, P.: New approach to nonrepetitive sequences. Random Struct. Algorithms 42(2), 214\u2013225 (2013)","journal-title":"Random Struct. Algorithms"},{"issue":"1","key":"18_CR8","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1051\/ita\/2016007","volume":"50","author":"G Gu\u00e9gan","year":"2016","unstructured":"Gu\u00e9gan, G., Ochem, P.: A short proof that shuffle squares are 7-avoidable. RAIRO Theor. Inf. Appl. 50(1), 101\u2013103 (2016)","journal-title":"RAIRO Theor. Inf. Appl."},{"key":"18_CR9","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"},{"key":"18_CR10","doi-asserted-by":"crossref","unstructured":"Moser, R.A., Tardos, G.: A constructive proof of the general Lov\u00e1sz local lemma. J. ACM 57(2), 11:1\u201311:15 (2010)","DOI":"10.1145\/1667053.1667060"},{"key":"18_CR11","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."},{"issue":"2","key":"18_CR12","first-page":"2","volume":"21","author":"P Ochem","year":"2014","unstructured":"Ochem, P., Pinlou, A.: Application of entropy compression in pattern avoidance. Electron. J. Comb. 21(2), 2 (2014)","journal-title":"Electron. J. Comb."},{"key":"18_CR13","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, 297\u2013311 (1984)","DOI":"10.1016\/0166-218X(84)90006-4"},{"key":"18_CR14","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":"337","key":"18_CR15","doi-asserted-by":"publisher","first-page":"2489","DOI":"10.1090\/mcom\/3732","volume":"91","author":"M Rosenfeld","year":"2022","unstructured":"Rosenfeld, M.: Avoiding squares over words with lists of size three amongst four symbols. Math. Comput. 91(337), 2489\u20132500 (2022)","journal-title":"Math. Comput."},{"key":"18_CR16","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1051\/ita\/2010012","volume":"44","author":"AM Shur","year":"2010","unstructured":"Shur, A.M., Gorbunova, I.A.: On the growth rates of complexity of threshold languages. RAIRO Theor. Inf. Appl. 44, 175\u2013192 (2010)","journal-title":"RAIRO Theor. Inf. Appl."},{"key":"18_CR17","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/j.tcs.2015.07.027","volume":"601","author":"AM Shur","year":"2015","unstructured":"Shur, A.M.: Generating square-free words efficiently. Theor. Comput. Sci. 601, 67\u201372 (2015)","journal-title":"Theor. Comput. Sci."},{"key":"18_CR18","unstructured":"Thue, A.: \u00dcber unendliche Zeichenreihen. Norske vid. Selsk. Skr. Mat. Nat. Kl. 7, 1\u201322 (1906)"},{"key":"18_CR19","unstructured":"Thue, A.: \u00dcber die gegenseitige Lage gleicher Teile gewisser Zeichenreihen. Norske vid. Selsk. Skr. Mat. Nat. Kl. 1, 1\u201367 (1912)"}],"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-031-33264-7_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,18]],"date-time":"2023-05-18T08:06:16Z","timestamp":1684397176000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-33264-7_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031332630","9783031332647"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-33264-7_18","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":"19 May 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DLT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Developments in Language Theory","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":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dlt2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/dltwords2023.cs.umu.se\/dlt","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":"32","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":"59% - 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":"6","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":"4- Invited papers and 32 submissions (31 regular ones and one invited)","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)"}}]}}