Quasiperiodicities in Fibonacci strings
نویسندگان
چکیده
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.
منابع مشابه
The (non-)existence of perfect codes in Lucas cubes
A Fibonacci string of length $n$ is a binary string $b = b_1b_2ldots b_n$ in which for every $1 leq i < n$, $b_icdot b_{i+1} = 0$. In other words, a Fibonacci string is a binary string without 11 as a substring. Similarly, a Lucas string is a Fibonacci string $b_1b_2ldots b_n$ that $b_1cdot b_n = 0$. For a natural number $ngeq1$, a Fibonacci cube of dimension $n$ is denoted by $Gamma_n$ and i...
متن کاملOverlapping factors in words
The concept of quasiperiodicity is a generalization of the notion of periodicity where in contrast to periodicity the quasiperiods of a quasiperiodic string may overlap. A lot of research has been concentrated around algorithms for the computation of quasiperiodicities in strings while not much is known about bounds on their maximum number of occurrences in words. We study the overlapping facto...
متن کاملSimple Algorithm for Sorting the Fibonacci String Rotations
In this paper we focus on the combinatorial properties of the Fibonacci strings rotations. We first present a simple formula that, in constant time, determines the rank of any rotation (of a given Fibonacci string) in the lexicographically-sorted list of all rotations. We then use this information to deduce, also in constant time, the character that is stored at any one location of any given Fi...
متن کاملGeneralized Fibonacci cubes
Generalized Fibonacci cube Qd(f) is introduced as the graph obtained from the d-cube Qd by removing all vertices that contain a given binary string f as a substring. In this notation the Fibonacci cube Γd is Qd(11). The question whether Qd(f) is an isometric subgraph of Qd is studied. Embeddable and nonembeddable infinite series are given. The question is completely solved for strings f of leng...
متن کاملRobust transmission of unbounded strings using Fibonacci representations
Families of Fibonacci codes and Fibonacci representations are defined. Their main attributes are: (i) robustness, manifesting itself by the local containment of errors; (ii) simple encoding and and decoding. The main applica· tiOD explored is the transmission of binary strings whose length is in aD. unknown range, using robust Fibonacci representations instead of the conventional errorsensitive...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Ars Comb.
دوره 129 شماره
صفحات -
تاریخ انتشار 2016