Elsevier

Theoretical Computer Science

Volume 349, Issue 3, 16 December 2005, Pages 429-442
Theoretical Computer Science

Locating factors of the infinite Fibonacci word

https://doi.org/10.1016/j.tcs.2005.08.033Get rights and content
Under an Elsevier user license
open archive

Abstract

Let τ=(5-1)/2. Let a, b be two distinct letters. The infinite Fibonacci word is the infinite wordG=babbababbabbababbababbabbawhose nth letter is a (resp., b) if [(n+1)τ]-[nτ]=0 (resp., 1). For a factor w of G, the location of w is the set of all positions in G at which w occurs. Only the locations of the following factors of G are already known: squares, singular words and those factors of G whose lengths are Fibonacci numbers. The purpose of this paper is to determine the locations of all factors of G. Our results contain all the known ones as consequences. Moreover, using our results, we are able to identify any factor of G whenever its starting position and length are given; also we are able to tell whether two suffixes of G have a common prefix of a certain length.

Keywords

Infinite Fibonacci word
Factor
Location

Cited by (0)