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
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
STACS '98 Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science
Automatic Sequences: Theory, Applications, Generalizations
Automatic Sequences: Theory, Applications, Generalizations
Some properties of the factors of Sturmian sequences
Theoretical Computer Science
Applied Combinatorics on Words (Encyclopedia of Mathematics and its Applications)
Applied Combinatorics on Words (Encyclopedia of Mathematics and its Applications)
On critical exponents in fixed points of non-erasing morphisms
Theoretical Computer Science
Every real number greater than 1 is a critical exponent
Theoretical Computer Science
On critical exponents in fixed points of non-erasing morphisms
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
| Hi-index | 0.00 |
Let w be an infinite fixed point of a binary k-uniform morphism f, and let E(w) be the critical exponent of w. We give necessary and sufficient conditions for E(w) to be bounded, and an explicit formula to compute it when it is. In particular, we show that E(w) is always rational. We also sketch an extension of our method to non-uniform morphisms over general alphabets. MSC: 68R15.