Repetitiveness of languages generated by morphisms

DOI10.1016/S0304-3975(99)00238-8MaRDI QIDQ1575438zbMATH OpenOpenAlexFDO

Authors Yuji Kobayashi, Friedrich Otto

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

zbMATH Keywords

D0L-languageQuasi-repetitive elementRepetitive morphism

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• scientific article; zbMATH DE number 1361492
• scientific article; zbMATH DE number 1088280
• Repetition of subwords in DOL languages
• On k-repetition freeness of length uniform morphisms over a binary alphabet

Cites work

• scientific article; zbMATH DE number 4112045 (Why is no real title available?)
• scientific article; zbMATH DE number 3660804 (Why is no real title available?)
• scientific article; zbMATH DE number 107464 (Why is no real title available?)
• scientific article; zbMATH DE number 3569855 (Why is no real title available?)
• scientific article; zbMATH DE number 1737190 (Why is no real title available?)
• scientific article; zbMATH DE number 3311755 (Why is no real title available?)
• Every iterated morphism yields a co-CFL
• If a DOL language is k-power free then it is circular
• On the subword complexity of square-free DOL languages
• Periodic D0L 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
• The equations h(w)=w^ n in binary alphabets

Cited in

(8)

• Repetition of subwords in DOL languages
• On critical exponents in fixed points of non-erasing morphisms
• On Critical exponents in fixed points ofk-uniform binary morphisms
• Automatic sequences of rank two
• Some remarks about stabilizers
• scientific article; zbMATH DE number 1361492 (Why is no real title available?)
• An algorithm for enumerating all infinite repetitions in a D0L-system
• Characterization of circular D0L-systems

This page was built for publication: Repetitiveness of languages generated by morphisms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1575438)