2026-07-31T18:29:26Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:6454 2024-03-06T10:38:19Z ddc:004 open_access

Determining Sets of Quasiperiods of Infinite Words Gamard, Guilhem Richomme, Gwenaël combinatorics on Words quasiperiodicity Sturmian 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Guilhem Gamard and Gwenaël Richomme 2016 Is Part Of LIPIcs, Volume 58, 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.MFCS.2016.40 urn:nbn:de:0030-drops-64540 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2016.40 eng https://creativecommons.org/licenses/by/3.0/legalcode