An algorithm for enumerating all infinite repetitions in a D0L-system

@article{Klouda2015AnAF,
  title={An algorithm for enumerating all infinite repetitions in a D0L-system},
  author={Karel Klouda and Step{\'a}n Starosta},
  journal={J. Discrete Algorithms},
  year={2015},
  volume={33},
  pages={130-138}
}
  • Karel Klouda, Stepán Starosta
  • Published 2015
  • Computer Science, Mathematics
  • J. Discrete Algorithms
  • We describe a simple algorithm that finds all primitive words v such that v k is a factor of the language of a given D0L-system for all k. It follows that the number of such words is finite. This polynomial-time algorithm can be also used to decide whether a D0L-system is repetitive. 

    Figures and Topics from this paper.

    Explore Further: Topics Discussed in This Paper

    Characterization of circular D0L-systems
    2
    Synchronizing delay for binary uniform morphisms
    6
    Morphic words and equidistributed sequences
    Equidistributed sequences and pure morphic subshifts

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 22 REFERENCES
    Repetition of Subwords in DOL Languages
    25
    On Critical exponents in fixed points of k-uniform binary morphisms
    4
    Repetitiveness of languages generated by morphisms
    9
    Cancellation and periodicity properties of iterated morphisms
    8
    Periodicity and Ultimate Periodicity of D0L Systems
    • B. Lando
    • Mathematics, Computer Science
    • 1991
    5
    On Critical Exponents in Fixed Points of Non-erasing Morphisms
    21