Circularity and repetitiveness in non-injective DF0L systems
Discrete Mathematics
2025-08-08 v1
Abstract
We study circularity in DF0L systems, a generalization of D0L systems. We focus on two different types of circularity, called weak and strong circularity. When the morphism is injective on the language of the system, the two notions are equivalent, but they may differ otherwise. Our main result shows that failure of weak circularity implies unbounded repetitiveness, and that unbounded repetitiveness implies failure of strong circularity. This extends previous work by the second and third authors for injective systems. To help motivate this work, we also give examples of non-injective but strongly circular systems.
Cite
@article{arxiv.2504.15828,
title = {Circularity and repetitiveness in non-injective DF0L systems},
author = {Herman Goulet-Ouellet and Karel Klouda and Štěpán Starosta},
journal= {arXiv preprint arXiv:2504.15828},
year = {2025}
}