An Algorithm Enumerating All Infinite Repetitions in a D0L System
Combinatorics
2017-05-31 v3 Formal Languages and Automata Theory
Abstract
We describe a simple algorithm which, for a given D0L system, returns all factors such that is in the language of the system for all . This algorithm can be used to decide whether a D0L system is repetitive.
Cite
@article{arxiv.1307.6408,
title = {An Algorithm Enumerating All Infinite Repetitions in a D0L System},
author = {Karel Klouda and Štěpán Starosta},
journal= {arXiv preprint arXiv:1307.6408},
year = {2017}
}
Comments
10 pages, one figure