|
Diskretnyi Analiz i Issledovanie Operatsii, Ser. 1, 2006, Volume 13, Issue 2, Pages 27–37
(Mi da29)
|
|
|
|
This article is cited in 6 scientific papers (total 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.
Citation:
R. M. Kolpakov, “On the number of repetition-free words”, Diskretn. Anal. Issled. Oper., Ser. 1, 13:2 (2006), 27–37; J. Appl. Industr. Math., 1:4 (2007), 453–462
Linking options:
https://www.mathnet.ru/eng/da29 https://www.mathnet.ru/eng/da/v13/s1/i2/p27
|
Statistics & downloads: |
Abstract page: | 426 | Full-text PDF : | 137 | References: | 90 |
|