Repetition of subwords in DOL languages
From MaRDI portal
Publication:3341931
DOI10.1016/S0019-9958(83)80028-XzbMath0549.68076MaRDI QIDQ3341931
Andrzej Ehrenfeucht, Grzegorz Rozenberg
Publication date: 1983
Published in: Information and Control (Search for Journal in Brave)
Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Grammars and rewriting systems (68Q42)
Related Items (17)
Repetition-free words ⋮ Automatic sequences of rank two ⋮ On the subword equivalence problem for morphic words ⋮ On critical exponents in fixed points of non-erasing morphisms ⋮ Languages, D0L-systems, sets of curves, and surface automorphisms. ⋮ Infinite interval exchange transformations from shifts ⋮ Synchronizing delay for binary uniform morphisms ⋮ Bispecial factors in circular non-pushy D0L languages ⋮ If a DOL language is k-power free then it is circular ⋮ On Critical exponents in fixed points ofk-uniform binary morphisms ⋮ An algorithm for enumerating all infinite repetitions in a D0L-system ⋮ Generalized Sturmian languages ⋮ Some remarks about stabilizers ⋮ Characterization of circular D0L-systems ⋮ Periodicity of morphic words ⋮ ON UNIFORMLY RECURRENT MORPHIC SEQUENCES ⋮ Repetitiveness of languages generated by morphisms
This page was built for publication: Repetition of subwords in DOL languages
