The exact number of squares in Fibonacci words
From MaRDI portal
Publication:1292484
DOI10.1016/S0304-3975(98)00252-7zbMath0916.68122MaRDI QIDQ1292484
Aviezri S. Fraenkel, R. Jamie Simpson
Publication date: 21 June 1999
Published in: Theoretical Computer Science (Search for Journal in Brave)
68R15: Combinatorics on words
Related Items
Simple and flexible detection of contiguous repeats using a suffix tree, On the number of frames in binary words, Optimality of some algorithms to detect quasiperiodicities, Repetitions in strings: algorithms and combinatorics, Euclidean strings, Repetitive perhaps, but certainly not boring, Powers in Sturmian sequences, Powers in a class of \(\mathcal A\)-strict standard episturmian words, ASYMPTOTIC BEHAVIOUR OF THE MAXIMAL NUMBER OF SQUARES IN STANDARD STURMIAN WORDS
Cites Work
- Unnamed Item
- Unnamed Item
- An optimal algorithm for computing the repetitions in a word
- How many squares can a string contain?
- A characterization of the squares in a Fibonacci string
- Squares, cubes, and time-space efficient string searching
- A combinatorial theorem on $p$-power-free words and an application to semigroups
- Repetitions in the Fibonacci infinite word
- Beatty Sequences, Continued Fractions, and Certain Shift Operators
- Determination of [nθ by its Sequence of*Differences]
