Parcourir Narad Rampersad par sujet "Cubefree words"
Voici les éléments 1-1 de 1
-
Cubefree words with many squares
(Discrete Mathematics and Theoretical Computer Science, 2014-05-13)We construct infinite cubefree binary words containing exponentially many distinct squares of length n . We also show that for every positive integer n , there is a cubefree binary square of length 2n.