Characterization of circular D0L-systems

DOI10.1016/j.tcs.2019.04.021zbMath1430.68136arXiv1401.0038OpenAlexW2964077429WikidataQ127864965 ScholiaQ127864965MaRDI QIDQ2272391

Karel Klouda, Štěpán Starosta

Publication date: 10 September 2019

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1401.0038

zbMATH Keywords

repetitionD0L-systemcircular D0L-system

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items

Automatic sequences of rank two, Substitution-dynamics and invariant measures for infinite alphabet-path space, Synchronizing delay for binary uniform morphisms, Morphic words and equidistributed sequences, Recognizability for sequences of morphisms

Cites Work

• An algorithm for enumerating all infinite repetitions in a D0L-system
• Periodicity and ultimate periodicity of D0L systems
• Elementary homomorphisms and a solution of the DOL sequence equivalence problem
• Repetitiveness of languages generated by morphisms
• Repetition of subwords in DOL languages
• If a DOL language is k-power free then it is circular
• Reconnaissabilité des substitutions et complexité des suites automatiques
• Unnamed Item
• Unnamed Item
• Unnamed Item