Bispecial factors in circular non-pushy D0L languages
Review articleOpen access
2012/08/03 Full-length article DOI: 10.1016/j.tcs.2012.05.007
Journal: Theoretical Computer Science
Abstract:
AbstractWe 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.
Request full text