Bispecial factors in circular non-pushy D0L languages
arXiv:1201.1186 · doi:10.1016/j.tcs.2012.05.007
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.
18 pages, 5 figures
Cited by in corpus (7)
- Factor Complexity of S-adic sequences generated by the Arnoux-Rauzy-Poincaré Algorithm
- Palindromic richness for languages invariant under more symmetries
- Palindromic sequences generated from marked morphisms
- Synchronizing delay for binary uniform morphisms
- On substitutions closed under derivation: examples
- Suffix conjugates for a class of morphic subshifts
- On two conjectures of Shallit about Thue-Morse-like sequences