Characterization of circular D0L systems
Combinatorics
2014-01-03 v1
Abstract
We prove that every non-circular D0L system contains arbitrarily long repetitions. This result was already published in 1993 by Mignosi and S\'e\'ebold, however their proof is only a sketch. We give here a complete proof. Further, employing our previous result, we give a simple algorithm to test circularity of an injective D0L system.
Keywords
Cite
@article{arxiv.1401.0038,
title = {Characterization of circular D0L systems},
author = {Karel Klouda and Štěpán Starosta},
journal= {arXiv preprint arXiv:1401.0038},
year = {2014}
}
Comments
10 pages, 4 figures