Результаты исследований: Научные публикации в периодических изданиях › статья › Рецензирование
We consider a new family of factorial languages whose subword complexity grows as Φ(nα), where α is the only positive root of some transcendental equation. The asymptotic growth of the complexity function of these languages is studied by discrete and analytical methods, a corollary of the Wiener-Pitt theorem inclusive. The factorial languages considered are also languages of arithmetical factors of infinite words; so, we describe a new family of infinite words with an unusual growth of arithmetical complexity.
Язык оригинала | английский |
---|---|
Страницы (с-по) | 63-73 |
Число страниц | 11 |
Журнал | Siberian Mathematical Journal |
Том | 52 |
Номер выпуска | 1 |
DOI | |
Состояние | Опубликовано - 1 янв 2011 |
ID: 47858490