Some properties of the singular words of the Fibonacci word
European Journal of Combinatorics
Some combinatorial properties of Sturmian words
Theoretical Computer Science
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
&agr;-words and factors of characteristic sequences
Discrete Mathematics
A representation theorem of the suffixes of characteristic sequences
Discrete Applied Mathematics
European Journal of Combinatorics
Some properties of the factors of Sturmian sequences
Theoretical Computer Science
Occurrences of palindromes in characteristic Sturmian words
Theoretical Computer Science
Locating factors of the infinite Fibonacci word
Theoretical Computer Science
Factors of characteristic words: Location and decompositions
Theoretical Computer Science
Fibonacci word patterns in two-way infinite Fibonacci words
Theoretical Computer Science
| Hi-index | 5.23 |
Let @a be an irrational number with 0=1. For a factor w of f"@a, the location of w is the set of all positions in f"@a at which w occurs. The locations of all factors of f"@a have been determined by Chuan and Ho recently. In this paper, we obtain other formulas for the locations of factors of f"@a, using the generalized Zeckendorf representation of nonnegative integers. These results are equivalent to the known results obtained by Chuan and Ho in the case @a=3-52. We compute the longest common prefix of any two suffixes of f"@a and compute the order number and location index of each factor of f"@a, given its length and a position in f"@a at which it begins.