Periodic-Like Words

Authors:
Arturo Carpi;Aldo de Luca
Affiliations:
-;-
Venue:
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Year:
2000

Citing 3
Cited 0

On the combinatorics of finite words

Theoretical Computer Science
Words and special factors

Theoretical Computer Science
Repetitions and Boxes in Words and Pictures

Jewels are Forever, Contributions on Theoretical Computer Science in Honor of Arto Salomaa

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce the notion of periodic-like word. It is a word whose longest repeated prefix is not right special. Some different characterizations of this concept are given. We derive a new condition ensuring that the greatest common divisor of two periods of a word is a period, too. Then we characterize periodic-like words having the same set of proper boxes, in terms of the important notion of root-conjugacy. Finally, some new uniqueness conditions for words, related to the maximal box theorem are given.