| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 438812 | Theoretical Computer Science | 2012 | 12 Pages |
Abstract
We study bispecial factors in fixed points of morphisms. In particular, we propose a simple method of finding 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 exponents.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
