On critical exponents in fixed points of non-erasing morphisms
Author:
- Dalia KriegerDKDalia Krieger
- 1 May 2007
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 376 (1-2) , 70-88
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Some properties of the factors of Sturmian sequencesTheoretical Computer Science, 2003
- The Index of Sturmian SequencesEuropean Journal of Combinatorics, 2002
- Fractional powers in Sturmian wordsTheoretical Computer Science, 2001
- Special factors, periodicity, and an application to Sturmian wordsActa Informatica, 2000
- Sturmian words and words with a critical exponentTheoretical Computer Science, 2000
- Repetitiveness of languages generated by morphismsTheoretical Computer Science, 2000
- Puissance de mots et reconnaissabilité des points fixes d'une substitutionTheoretical Computer Science, 1992
- Repetitions in the Fibonacci infinite wordRAIRO - Theoretical Informatics and Applications, 1992
- Infinite words with linear subword complexityTheoretical Computer Science, 1989
- Repetition of subwords in DOL languagesInformation and Control, 1983