Infinite words with linear subword complexity
Theoretical Computer Science - Conference on arithmetics and coding systems, Marseille-Luminy, June 1987
Some properties of the singular words of the Fibonacci word
European Journal of Combinatorics
A division property of the Fibonacci word
Information Processing Letters
&agr;-words and factors of characteristic sequences
Discrete Mathematics
A representation theorem of the suffixes of characteristic sequences
Discrete Applied Mathematics
Sturmian morphisms and &agr;-words
Theoretical Computer Science
Some properties of the factors of Sturmian sequences
Theoretical Computer Science
Locating factors of the infinite Fibonacci word
Theoretical Computer Science
Factors of characteristic words: Location and decompositions
Theoretical Computer Science
Theoretical Computer Science
Locating factors of a characteristic word via the generalized Zeckendorf representation of numbers
Theoretical Computer Science
Discrete Applied Mathematics
Hi-index | 5.23 |
The studies of 1-Fibonacci word patterns and 0-Fibonacci word patterns were initiated by Turner (1988) [18] and Chuan (1993) [2] respectively. It is known that each proper suffix of the infinite Fibonacci word is an r-Fibonacci word pattern, r@?{0,1}. In this paper, we consider the suffixes of the two two-way infinite extensions G and G^' of the infinite Fibonacci word. We obtain necessary and sufficient conditions for suffixes of G and G^' to be r-Fibonacci word patterns. This gives us all the mechanical words with slope @a=5-12 which are r-Fibonacci word patterns. All possible r-seed words of each of them are determined. Finally, images of suffixes of G and G^' under the action of certain Sturmian morphisms are computed.