On Critical exponents in fixed points ofk-uniform binary morphisms
From MaRDI portal
Publication:3549288
DOI10.1051/ITA:2007042zbMATH Open1170.68034OpenAlexW2077168540MaRDI QIDQ3549288FDOQ3549288
Authors: Dalia Krieger 
Publication date: 22 December 2008
Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/92907
Recommendations
- On Critical Exponents in Fixed Points of Binary k-Uniform Morphisms
- On Critical Exponents in Fixed Points of Non-erasing Morphisms
- On critical exponents in fixed points of non-erasing morphisms
- For each \(\alpha > 2\) there is an infinite binary word with critical exponent \(\alpha \)
- The critical exponent functions
Cites Work
- Power of words and recognizability of fixpoints of a substitution
- Title not available (Why is that?)
- Automatic Sequences
- The equation \(a_ M=b^ Nc^ P\) in a free group
- The index of Sturmian sequences
- Sturmian words and words with a critical exponent
- Special factors, periodicity, and an application to Sturmian words
- Infinite words with linear subword complexity
- Repetitions in the Fibonacci infinite word
- Title not available (Why is that?)
- Fractional powers in Sturmian words
- On critical exponents in fixed points of non-erasing morphisms
- Uniqueness Theorems for Periodic Functions
- Some properties of the factors of Sturmian sequences.
- Repetition of subwords in DOL languages
- Repetitiveness of languages generated by morphisms
- On Critical Exponents in Fixed Points of Binary k-Uniform Morphisms
- On combinatorial properties of the Arshon sequence
Cited In (9)
- A small morphism for which the fixed point has an abelian critical exponent less than 2
- On Critical Exponents in Fixed Points of Non-erasing Morphisms
- The critical exponent functions
- On Critical Exponents in Fixed Points of Binary k-Uniform Morphisms
- On critical exponents in fixed points of non-erasing morphisms
- Periodicity, repetitions, and orbits of an automatic sequence
- On square factors and critical factors of \(k\)-bonacci words on infinite alphabet
- Synchronizing delay for binary uniform morphisms
- An algorithm for enumerating all infinite repetitions in a D0L-system
This page was built for publication: On Critical exponents in fixed points ofk-uniform binary morphisms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3549288)
