Research output: Contribution to journal › Article › peer-review
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.
Original language | English |
---|---|
Pages (from-to) | 63-73 |
Number of pages | 11 |
Journal | Siberian Mathematical Journal |
Volume | 52 |
Issue number | 1 |
DOIs | |
State | Published - 1 Jan 2011 |
ID: 47858490