If a DOL language is k-power free then it is circular
From MaRDI portal
Publication:4630287
DOI10.1007/3-540-56939-1_98zbMath1422.68157OpenAlexW1550216888MaRDI QIDQ4630287
Patrice Séébold, Filippo Mignosi
Publication date: 29 March 2019
Published in: Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-56939-1_98
Related Items (19)
Automatic sequences of rank two ⋮ On the joint subword complexity of automatic sequences ⋮ The subword complexity of fixed points of binary uniform morphisms ⋮ Existence of finite test-sets for \(k\)-power-freeness of uniform morphisms ⋮ On critical exponents in fixed points of non-erasing morphisms ⋮ Separators in infinite words generated by morphisms. ⋮ Abelian combinatorics on words: a survey ⋮ Fixed points avoiding abelian \(k\)-powers ⋮ RECURRENCE FUNCTION OF THE TERNARY THUE-MORSE WORD ⋮ Substitution-dynamics and invariant measures for infinite alphabet-path space ⋮ Synchronizing delay for binary uniform morphisms ⋮ Bispecial factors in circular non-pushy D0L languages ⋮ An algorithm for enumerating all infinite repetitions in a D0L-system ⋮ Periodicity, repetitions, and orbits of an automatic sequence ⋮ Characterization of circular D0L-systems ⋮ On factor graphs of DOL words ⋮ Recognizability for sequences of morphisms ⋮ Repetitiveness of languages generated by morphisms ⋮ Some results on \(k\)-power-free morphisms
Cites Work
- A characterization of power-free morphisms
- Sequences generated by infinitely iterated morphisms
- Substitution dynamical systems - spectral analysis
- On the subword complexity of square-free DOL languages
- Sharp characterizations of squarefree morphisms
- Power of words and recognizability of fixpoints of a substitution
- Infinite words with linear subword complexity
- On cube-free \(\omega\)-words generated by binary morphisms
- Uniformly growing k-th power-free homomorphisms
- On the size of a square-free morphism on a three letter alphabet
- Valeurs propres des systèmes dynamiques définis par des substitutions de longueur variable
- Repetition of subwords in DOL languages
- On the periodicity of morphisms on free monoids
- A linear-time algorithm to decide whether a binary word contains an overlap
- Repetitions in the Fibonacci infinite word
- Minimal flows arising from substitutions of non-constant length
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: If a DOL language is k-power free then it is circular
