The exact number of squares in Fibonacci words
- 28 April 1999
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 218 (1), 95-106
- https://doi.org/10.1016/s0304-3975(98)00252-7
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- How Many Squares Can a String Contain?Journal of Combinatorial Theory, Series A, 1998
- A characterization of the squares in a Fibonacci stringTheoretical Computer Science, 1997
- Squares, cubes, and time-space efficient string searchingAlgorithmica, 1995
- Repetitions in the Fibonacci infinite wordRAIRO - Theoretical Informatics and Applications, 1992
- A combinatorial theorem on $p$-power-free words and an application to semigroupsRAIRO - Theoretical Informatics and Applications, 1990
- An optimal algorithm for computing the repetitions in a wordInformation Processing Letters, 1981
- Determination of [nθ] by its Sequence of*DifferencesCanadian Mathematical Bulletin, 1978
- Beatty Sequences, Continued Fractions, and Certain Shift OperatorsCanadian Mathematical Bulletin, 1976