{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:22:18Z","timestamp":1759638138827},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642387708"},{"type":"electronic","value":"9783642387715"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38771-5_34","type":"book-chapter","created":{"date-parts":[[2013,6,10]],"date-time":"2013-06-10T02:16:25Z","timestamp":1370830585000},"page":"384-395","source":"Crossref","is-referenced-by-count":1,"title":["Repetition Avoidance in Circular Factors"],"prefix":"10.1007","author":[{"given":"Hamoon","family":"Mousavi","sequence":"first","affiliation":[]},{"given":"Jeffrey","family":"Shallit","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"34_CR1","doi-asserted-by":"crossref","unstructured":"Aberkane, A., Currie, J.D.: There exist binary circular 5\/2\u2009+\u2009 power free words of every length. Electronic J. Combin.\u00a011(1) (2004) Paper #R10, http:\/\/www1.combinatorics.org\/Volume_11\/Abstracts\/v11i1r10.html","DOI":"10.37236\/1763"},{"key":"34_CR2","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/0304-3975(88)90009-6","volume":"23","author":"F.-J. Brandenburg","year":"1983","unstructured":"Brandenburg, F.-J.: Uniformly growing k-th power-free homomorphisms. Theoret. Comput. Sci.\u00a023, 69\u201382 (1983)","journal-title":"Theoret. Comput. Sci."},{"key":"34_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.\u00a0385, 137\u2013151 (2007)","journal-title":"Theoret. Comput. Sci."},{"key":"34_CR4","doi-asserted-by":"publisher","first-page":"1063","DOI":"10.1090\/S0025-5718-2010-02407-X","volume":"80","author":"J. Currie","year":"2011","unstructured":"Currie, J., Rampersad, N.: A proof of Dejean\u2019s conjecture. Math. Comp.\u00a080, 1063\u20131070 (2011)","journal-title":"Math. Comp."},{"key":"34_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\u00a013, 90\u201399 (1972)","journal-title":"J. Combin. Theory. Ser. A"},{"key":"34_CR6","doi-asserted-by":"crossref","unstructured":"Gorbunova, I.A.: Repetition threshold for circular words. Electronic J. Combin.\u00a019(4) Paper #11, http:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v19i4p11","DOI":"10.37236\/2365"},{"key":"34_CR7","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1016\/j.ipl.2010.05.005","volume":"110","author":"T. Harju","year":"2010","unstructured":"Harju, T., Nowotka, D.: Cyclically repetition-free words on small alphabets. Inform. Process Lett.\u00a0110, 591\u2013595 (2010)","journal-title":"Inform. Process Lett."},{"key":"34_CR8","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1016\/j.tcs.2005.07.016","volume":"345","author":"L. Ilie","year":"2005","unstructured":"Ilie, L., Ochem, P., Shallit, J.: A generalization of repetition threshold. Theoret. Comput. Sci.\u00a0345, 359\u2013369 (2005)","journal-title":"Theoret. Comput. Sci."},{"key":"34_CR9","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.\u00a0412, 3010\u20133018 (2011)","journal-title":"Theoret. Comput. Sci."},{"key":"34_CR10","unstructured":"Thue, A.: \u00dcber unendliche Zeichenreihen. Norske vid. Selsk. Skr. Mat. Nat. Kl. 7, 1\u201322 (1906), Reprinted in Selected Mathematical Papers of Axel Thue. Nagell, T. (ed.) Universitetsforlaget, Oslo, pp. 139\u2013158 (1977)"},{"key":"#cr-split#-34_CR11.1","unstructured":"Thue, A.: \u00dcber die gegenseitige Lage gleicher Teile gewisser Zeichenreihen. Norske vid. Selsk. Skr. Mat. Nat. Kl. 1, 1-67 (1912)"},{"key":"#cr-split#-34_CR11.2","unstructured":"Reprinted in Selected Mathematical Papers of Axel Thue. Nagell, T. (ed.) Universitetsforlaget, Oslo, pp. 413-478 (1977)"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38771-5_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,28]],"date-time":"2020-07-28T02:16:22Z","timestamp":1595902582000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38771-5_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642387708","9783642387715"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38771-5_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}