{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,29]],"date-time":"2025-11-29T07:48:46Z","timestamp":1764402526771},"reference-count":11,"publisher":"EDP Sciences","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Theor. Inf. Appl."],"published-print":{"date-parts":[[2012,1]]},"DOI":"10.1051\/ita\/2011109","type":"journal-article","created":{"date-parts":[[2011,8,26]],"date-time":"2011-08-26T14:06:27Z","timestamp":1314367587000},"page":"17-31","source":"Crossref","is-referenced-by-count":15,"title":["Fewest repetitions in infinite binary words"],"prefix":"10.1051","volume":"46","author":[{"given":"Golnaz","family":"Badkobeh","sequence":"first","affiliation":[]},{"given":"Maxime","family":"Crochemore","sequence":"additional","affiliation":[]}],"member":"250","published-online":{"date-parts":[[2011,8,26]]},"reference":[{"key":"R1","unstructured":"G. Badkobeh and M. Crochemore, An infinite binary word containing only three distinct squares (2010) Submitted."},{"key":"R2","unstructured":"Currie J.D. and Rampersad N., A proof of Dejean\u2019s conjecture.Math. Comput.80(2011) 1063\u20131070."},{"key":"R3","doi-asserted-by":"crossref","unstructured":"Dejean F., Sur un th\u00e9or\u00e8me de Thue.J. Comb. Theory, Ser. A13(1972) 90\u201399.","DOI":"10.1016\/0097-3165(72)90011-8"},{"key":"R4","doi-asserted-by":"crossref","unstructured":"A.S. Fraenkel and J. Simpson, How many squares must a binary sequence contain?Electr. J. Comb.2(1995).","DOI":"10.37236\/1196"},{"key":"R5","unstructured":"Harju T. and Nowotka D., Binary words with few squares.Bulletin of the EATCS89(2006) 164\u2013166."},{"key":"R6","doi-asserted-by":"crossref","unstructured":"Karhum\u00e4ki J. and Shallit J., Polynomial versus exponential growth in repetition-free binary words.J. Comb. Th. (A)105(2004) 335\u2013347.","DOI":"10.1016\/j.jcta.2003.12.004"},{"key":"R7","doi-asserted-by":"crossref","unstructured":"M. Lothaire Ed.,Combinatorics on Words. Cambridge University Press, 2nd edition (1997).","DOI":"10.1017\/CBO9780511566097"},{"key":"R8","unstructured":"Rampersad N., J. Shallit and M. Wei Wang, Avoiding large squares in infinite binary words.Theoret. Comput. Sci.339(2005) 19\u201334."},{"key":"R9","doi-asserted-by":"crossref","unstructured":"Rao M., Last cases of Dejean\u2019s conjecture.Theor. Comput. Sci.412(2011) 3010\u20133018.","DOI":"10.1016\/j.tcs.2010.06.020"},{"key":"R10","doi-asserted-by":"crossref","unstructured":"Shallit J., Simultaneous avoidance of large squares and fractional powers in infinite binary words.Int. J. Found. Comput. Sci.15(2004) 317\u2013327.","DOI":"10.1142\/S0129054104002443"},{"key":"R11","unstructured":"Thue A., \u00dcber unendliche Zeichenreihen.Norske Vid. Selsk. Skr. I. Mat. Nat. Kl. Christiana7(1906) 1\u201322."}],"container-title":["RAIRO - Theoretical Informatics and Applications"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/2011109\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,22]],"date-time":"2020-06-22T19:09:40Z","timestamp":1592852980000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/2011109"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,8,26]]},"references-count":11,"journal-issue":{"issue":"1"},"alternative-id":["ita100036"],"URL":"https:\/\/doi.org\/10.1051\/ita\/2011109","relation":{},"ISSN":["0988-3754","1290-385X"],"issn-type":[{"value":"0988-3754","type":"print"},{"value":"1290-385X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,8,26]]}}}