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

We describe a simple algorithm that finds all primitive words v   such that vkvk 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.