An Algorithm Enumerating All Infinite Repetitions in a D0L System
Abstract
We describe a simple algorithm which, for a given D0L system, returns all factors $v$ such that $v^k$ is in the language of the system for all $k$. This algorithm can be used to decide whether a D0L system is repetitive.
- Publication:
-
arXiv e-prints
- Pub Date:
- July 2013
- DOI:
- 10.48550/arXiv.1307.6408
- arXiv:
- arXiv:1307.6408
- Bibcode:
- 2013arXiv1307.6408K
- Keywords:
-
- Mathematics - Combinatorics;
- Computer Science - Formal Languages and Automata Theory;
- 68R15;
- G.2.1
- E-Print:
- 10 pages, one figure