This article is cited in 6 papers

On the number of repetition-free words

R. M. Kolpakov

M. V. Lomonosov Moscow State University, Faculty of Mechanics and Mathematics

Abstract: A well-known problem is studied of the number of repetition-free words of the two types: the square-free words over a three-letter alphabet and the cube-free words over a two-letter alphabet.

 English version: Journal of Applied and Industrial Mathematics, 2007, 1:4, 453–462

Bibliographic databases:

• 
• 
• 
•