An Algorithm Enumerating All Infinite Repetitions in a D0L System

Abstract

We describe a simple algorithm which, for a given D0L system, returns all factors $v$ such that $v^k$ is in the language of the system for all $k$. This algorithm can be used to decide whether a D0L system is repetitive.

10 pages, one figure

References in corpus (1)

• On minimal factorizations of words as products of palindromes

Cited by in corpus (5)

• Synchronizing delay for binary uniform morphisms
• The number of primitive words of unbounded exponent in the language of an HD0L-system is finite
• Circularity and repetitiveness in non-injective DF0L systems
• On the minimal components of substitution subshifts
• Morphic words and equidistributed sequences