论文信息 - On the number of repetition-free words - 字舞流文

On the number of repetition-free words

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.

Roman Kolpakov | R. Kolpakov

[1] Jean Berstel,et al. Growth of repetition-free words -- a review , 2005, Theor. Comput. Sci..

[2] Jan Brinkhuis,et al. NON-REPETITIVE SEQUENCES ON THREE SYMBOLS , 1983 .

[3] Veit Elser,et al. The entropy of square-free words , 1997 .

[4] Xinyu Sun. New Lower Bound On The Number of Ternary Square-Free Words , 2003 .

[5] A. Zimin. BLOCKING SETS OF TERMS , 1984 .

[6] Uwe Grimm,et al. On the Entropy and Letter Frequencies of Ternary Square-Free Words , 2004, Electron. J. Comb..

[7] Anne E. Edlin. The number of binary cube-free words of length up to 47 and their numerical analysis , 1999 .

[8] Lucian Ilie,et al. A generalization of repetition threshold , 2003, Theor. Comput. Sci..

[9] Franz-Josef Brandenburg,et al. Uniformly Growing k-TH Power-Free Homomorphisms , 1988, Theor. Comput. Sci..

[10] F. R. Gantmakher. The Theory of Matrices , 1984 .