Bispecial factors in circular non-pushy D0L languages
Combinatorics
2017-05-31 v1
Abstract
We study bispecial factors in fixed points of morphisms. In particular, we propose a simple method of how to find all bispecial words of non-pushy circular D0L-systems. This method can be formulated as an algorithm. Moreover, we prove that non-pushy circular D0L-systems are exactly those with finite critical exponent.
Cite
@article{arxiv.1201.1186,
title = {Bispecial factors in circular non-pushy D0L languages},
author = {Karel Klouda},
journal= {arXiv preprint arXiv:1201.1186},
year = {2017}
}
Comments
18 pages, 5 figures