Synchronizing delay for binary uniform morphisms
From MaRDI portal
Publication:906381
DOI10.1016/j.tcs.2015.11.043zbMath1333.68170arXiv1507.05223OpenAlexW2194387056MaRDI QIDQ906381
Karel Klouda, Kateřina Medková
Publication date: 21 January 2016
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1507.05223
Related Items
Cites Work
- Bispecial factors in circular non-pushy D0L languages
- An algorithm for enumerating all infinite repetitions in a D0L-system
- The equation \(a_ M=b^ Nc^ P\) in a free group
- Characterization of circular D0L-systems
- Repetition of subwords in DOL languages
- On Critical exponents in fixed points ofk-uniform binary morphisms
- If a DOL language is k-power free then it is circular
- Unnamed Item
- Unnamed Item