An infinite binary word containing only three distinct squares, 2010. ,
Fewest repetitions in infinite binary words. RAIRO - Theoretical Informatics and Applications DOI: 10.1051/ita, 2011. ,
URL : https://hal.archives-ouvertes.fr/hal-00742086
A proof of Dejean's conjecture, Math. Comput, vol.80, issue.274, pp.1063-1070, 2011. ,
Sur un th??or??me de Thue, Journal of Combinatorial Theory, Series A, vol.13, issue.1, pp.90-99, 1972. ,
DOI : 10.1016/0097-3165(72)90011-8
URL : http://doi.org/10.1016/0097-3165(72)90011-8
How Many Squares Must a Binary Sequence Contain? Electr, J. Comb, vol.2, 1995. ,
Binary Words with Few Squares, Bulletin of the EATCS, vol.89, pp.164-166, 2006. ,
A generalization of repetition threshold, Theor. Comput. Sci, vol.34523, pp.359-369, 2005. ,
URL : https://hal.archives-ouvertes.fr/hal-00307256
Polynomial versus exponential growth in repetition-free binary words, Journal of Combinatorial Theory, Series A, vol.105, issue.2, pp.335-347, 2004. ,
DOI : 10.1016/j.jcta.2003.12.004
A generator of morphisms for infinite words, RAIRO - Theoretical Informatics and Applications, vol.40, issue.3, pp.427-441, 2006. ,
DOI : 10.1051/ita:2006020
URL : https://hal.archives-ouvertes.fr/hal-00307126
Avoiding large squares in infinite binary words, Theoretical Computer Science, vol.339, issue.1, pp.19-34, 2005. ,
DOI : 10.1016/j.tcs.2005.01.005
Last cases of Dejean???s conjecture, Theoretical Computer Science, vol.412, issue.27, pp.3010-3018, 2011. ,
DOI : 10.1016/j.tcs.2010.06.020
SIMULTANEOUS AVOIDANCE OF LARGE SQUARES AND FRACTIONAL POWERS IN INFINITE BINARY WORDS, International Journal of Foundations of Computer Science, vol.15, issue.02, pp.317-327, 2004. ,
DOI : 10.1142/S0129054104002443
¨ Uber unendliche Zeichenreihen. Norske vid, Selsk. Skr. I. Mat. Nat. Kl. Christiana, vol.7, pp.1-22, 1906. ,