|
ИСТИНА |
Войти в систему Регистрация |
ИСТИНА ИНХС РАН |
||
Minimal letter frequency in $n$-power-free binary wordsстатья
- Авторы: Kolpakov R., Kucherov G.
- Сборник: Mathematical Foundations of Computer Science 1997, 22nd International Symposium, MFCS'97, Bratislava, Slovakia, August 25-29, 1997, Proceedings
- Серия: Lecture Notes in Computer Science
- Том: 1295
- Год издания: 1997
- Место издания: SPRINGER-VERLAG BERLIN
- Первая страница: 347
- Последняя страница: 357
- Аннотация: We show that the minimal proportion of one letter in an n-th power-free binary word is asymptotically 1/n. We also consider a generalization of n-th power-free words defined through the notion of exponent: a word is χ-th power-free for a real χ, if it does not contain subwords of exponent χ or more. We study the minimal proportion of one letter in an χ-th power-free binary word as a function of χ and prove, in particular, that this function is discontinuous.
- Добавил в систему: Колпаков Роман Максимович