Determining Sets of Quasiperiods of Infinite Words - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Conference Papers Year : 2016

Determining Sets of Quasiperiods of Infinite Words


A word is quasiperiodic if it can be obtained by concatenations and overlaps of a smaller word, called a quasiperiod. Based on links between quasiperiods, right special factors and square factors, we introduce a method to determine the set of quasiperiods of a given right infinite word. Then we study the structure of the sets of quasiperiods of right infinite words and, using our method, we provide examples of right infinite words with extremal sets of quasiperiods (no quasiperiod is quasiperiodic, all quasiperiods except one are quasiperiodic, . . . ). Our method is also used to provide a short proof of a recent characterization of quasiperiods of the Fibonacci word. Finally we extend this result to a new characterization of standard Sturmian words using a property of their sets of quasiperiods.
Fichier principal
Vignette du fichier
LIPIcs-MFCS-2016-40.pdf (427.36 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

lirmm-01369373 , version 1 (20-09-2016)





Guilhem Gamard, Gwenaël Richomme. Determining Sets of Quasiperiods of Infinite Words. MFCS: Mathematical Foundations of Computer Science, Aug 2016, Cracovie, Poland. pp.40:1-40:13, ⟨10.4230/LIPIcs.MFCS.2016.40⟩. ⟨lirmm-01369373⟩
158 View
165 Download



Gmail Facebook X LinkedIn More