On critical exponents in fixed points of non-erasing morphisms

DOI10.1016/j.tcs.2007.01.020zbMath1111.68058OpenAlexW1967372194MaRDI QIDQ880175

Dalia Krieger

Publication date: 11 May 2007

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2007.01.020

zbMATH Keywords

critical exponentcircular D0L languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70)

Related Items (17)

Abelian powers and repetitions in Sturmian words ⋮ A proof of Dejean’s conjecture ⋮ On square factors and critical factors of \(k\)-bonacci words on infinite alphabet ⋮ On minimal critical exponent of balanced sequences ⋮ The easily bored sequence ⋮ Bispecial factors in circular non-pushy D0L languages ⋮ On Critical exponents in fixed points ofk-uniform binary morphisms ⋮ An algorithm for enumerating all infinite repetitions in a D0L-system ⋮ Periodicity, repetitions, and orbits of an automatic sequence ⋮ Dejean's conjecture holds for \(n\geq 30\) ⋮ Some remarks about stabilizers ⋮ Infinite words containing squares at every position ⋮ The Critical Exponent is Computable for Automatic Sequences ⋮ Every real number greater than 1 is a critical exponent ⋮ Binary words with a given Diophantine exponent ⋮ Dejean's conjecture holds for N ≥ 27 ⋮ Subword complexity and power avoidance

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Every real number greater than 1 is a critical exponent
• Power of words and recognizability of fixpoints of a substitution
• The index of Sturmian sequences
• Some properties of the factors of Sturmian sequences.
• Repetitiveness of languages generated by morphisms
• Sturmian words and words with a critical exponent
• Special factors, periodicity, and an application to Sturmian words
• Infinite words with linear subword complexity
• Repetition of subwords in DOL languages
• Repetitions in the Fibonacci infinite word
• Automatic Sequences
• If a DOL language is k-power free then it is circular
• On Critical Exponents in Fixed Points of Binary k-Uniform Morphisms
• Fractional powers in Sturmian words

This page was built for publication: On critical exponents in fixed points of non-erasing morphisms