Repetition of subwords in DOL languages
Information and Control
On the factors of the Thue-Morse word on three symbols
Information Processing Letters
Mathematical Theory of L Systems
Mathematical Theory of L Systems
If a D0L Language is k-Power Free then it is Circular
ICALP '93 Proceedings of the 20th International Colloquium on Automata, Languages and Programming
STACS '98 Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science
On critical exponents in fixed points of non-erasing morphisms
Theoretical Computer Science
Palindromic richness for languages invariant under more symmetries
Theoretical Computer Science
| Hi-index | 5.23 |
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.