Detecting leftmost maximal periodicities (Q1825029)

A periodicity is a word of the form \(p^ mq\), where q is a prefix of p and \(m\geq 2\). The author gives an efficient algorithm to list the leftmost occurrences of periodicities within a string. This algorithm is linear in time, when the alphabet is known in advance, and of the order O(\(| x| \log | x|)\), if not, where x is the input string. As an application, the author solves several questions raised by Crochemore