Repetition of subwords in DOL languages
Information and Control
Infinite words with linear subword complexity
Theoretical Computer Science - Conference on arithmetics and coding systems, Marseille-Luminy, June 1987
Properties of words and recognizability of fixed points of a substitution
Theoretical Computer Science
Sturmian words and words with a critical exponent
Theoretical Computer Science
Special factors, periodicity, and an application to Sturmian words
Acta Informatica
Fractional powers in Sturmian words
Theoretical Computer Science
Repetiveness of languages generated by morphisms
Theoretical Computer Science - computing and combinatorics
The index of Sturmian sequences
European Journal of Combinatorics
On the Index of Sturmian Words
Jewels are Forever, Contributions on Theoretical Computer Science in Honor of Arto Salomaa
If a D0L Language is k-Power Free then it is Circular
ICALP '93 Proceedings of the 20th International Colloquium on Automata, Languages and Programming
Automatic Sequences: Theory, Applications, Generalizations
Automatic Sequences: Theory, Applications, Generalizations
Some properties of the factors of Sturmian sequences
Theoretical Computer Science
On critical exponents in fixed points of binary k-uniform morphisms
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Hi-index | 0.00 |
Let Σ be an alphabet of size t, let f:Σ*→Σ* be a non-erasing morphism, let w be an infinite fixed point of f, and let E(w) be the critical exponent of w. We prove that if E(w) is finite, then for a uniform f it is rational, and for a non-uniform f it lies in the field extension ${{\mathbb Q}[{\lambda_1},\ldots,{\lambda_\ell}]}$, where λ1,...,λℓ are the eigenvalues of the incidence matrix of f. In particular, E(w) is algebraic of degree at most t. Under certain conditions, our proof implies an algorithm for computing E(w). MSC: 68R15