Bispecial factors in circular non-pushy D0L languages

@article{Klouda2012BispecialFI,
  title={Bispecial factors in circular non-pushy D0L languages},
  author={Karel Klouda},
  journal={Theor. Comput. Sci.},
  year={2012},
  volume={445},
  pages={63-74}
}
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. 

Figures and Topics from this paper.

Explore Further: Topics Discussed in This Paper

Citations

Publications citing this paper.

References

Publications referenced by this paper.
SHOWING 1-10 OF 19 REFERENCES

Repetition of Subwords in DOL Languages

  • Information and Control
  • 1983
VIEW 3 EXCERPTS
HIGHLY INFLUENTIAL

On Critical Exponents in Fixed Points of Non-erasing Morphisms

  • Developments in Language Theory
  • 2006
VIEW 2 EXCERPTS

A

S. V. Avgustinovich
  • E. Frid, On bispecial words and subword complexity of D0L sequences., in: Proceedings of SETA’98, DMTCS series, Springer
  • 1999
VIEW 2 EXCERPTS

On Uniform DOL Words

  • STACS
  • 1998
VIEW 1 EXCERPT

On uniform D 0 L words , in : STACS 98 , Vol . 1373 of Lect

S. Varricchio De Luca
  • 1998