Repetitiveness of languages generated by morphisms
From MaRDI portal
Publication:1575438
DOI10.1016/S0304-3975(99)00238-8zbMath0947.68086OpenAlexW2083357883MaRDI QIDQ1575438
Friedrich Otto, Yuji Kobayashi
Publication date: 21 August 2000
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(99)00238-8
Related Items (6)
Automatic sequences of rank two ⋮ On critical exponents in fixed points of non-erasing morphisms ⋮ On Critical exponents in fixed points ofk-uniform binary morphisms ⋮ An algorithm for enumerating all infinite repetitions in a D0L-system ⋮ Some remarks about stabilizers ⋮ Characterization of circular D0L-systems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The equations \(h(w)=w^ n\) in binary alphabets
- Every iterated morphism yields a co-CFL
- Periodic D0L languages
- On the subword complexity of square-free DOL languages
- Proof of Dejean's conjecture for alphabets with \(5, 6, 7, 8, 9, 10\) and \(11\) letters
- Repetition of subwords in DOL languages
- Simplifications of homomorphisms
- If a DOL language is k-power free then it is circular
This page was built for publication: Repetitiveness of languages generated by morphisms
