2012/01/30 by Michalis Christou, Christou, Michalis, Maxime Crochemore +3
Computer Science · Mathematics · #Algorithms and Data Compression #Combinatorics (math.CO) #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #FOS: Mathematics #Geometric and Algebraic Topology #semigroups and automata theory
paper · pdf · doi:10.48550/arxiv.1201.6162
openalex publication_date 2012/01/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We consider the problem of finding quasiperiodicities in a Fibonacci string. A factor u of a string y is a cover of y if every letter of y falls within some occurrence of u in y. A string v is a seed of y, if it is a cover of a superstring of y. A left seed of a string y is a prefix of y that it is a cover of a superstring of y. Similarly a right seed of a string y is a suffix of y that it is a cover of a superstring of y. In this paper, we present some interesting results regarding quasiperiodicities in Fibonacci strings, we identify all covers, left/right seeds and seeds of a Fibonacci string and all covers of a circular Fibonacci string.