An algorithm for enumerating all infinite repetitions in a D0L-system
From MaRDI portal
Publication:491624
DOI10.1016/j.jda.2015.03.006zbMath1328.68102arXiv1307.6408OpenAlexW1964179101MaRDI QIDQ491624
Publication date: 18 August 2015
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1307.6408
Related Items
Automatic sequences of rank two, Lie complexity of words, Topological invariants for words of linear factor complexity, Palindromic length of words and morphisms in class \(\mathcal{P}\), Synchronizing delay for binary uniform morphisms, Characterization of circular D0L-systems, Morphic words and equidistributed sequences, Substitutive systems and a finitary version of Cobham's theorem
Uses Software
Cites Work
- Periodicity and ultimate periodicity of D0L systems
- On critical exponents in fixed points of non-erasing morphisms
- On the defect theorem and simplifiability
- Elementary homomorphisms and a solution of the DOL sequence equivalence problem
- Repetitiveness of languages generated by morphisms
- Cancellation and periodicity properties of iterated morphisms
- Repetition of subwords in DOL languages
- On Critical exponents in fixed points ofk-uniform binary morphisms
- On the periodicity of morphisms on free monoids
- If a DOL language is k-power free then it is circular
- Decidability of periodicity for infinite words
- Factor complexity
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
