The exact number of squares in Fibonacci words
From MaRDI portal
Publication:1292484
DOI10.1016/S0304-3975(98)00252-7zbMATH Open0916.68122MaRDI QIDQ1292484FDOQ1292484
Authors: Aviezri S. Fraenkel, Jamie Simpson
Publication date: 21 June 1999
Published in: Theoretical Computer Science (Search for Journal in Brave)
Recommendations
Cites Work
- Title not available (Why is that?)
- A combinatorial theorem on $p$-power-free words and an application to semigroups
- An optimal algorithm for computing the repetitions in a word
- Repetitions in the Fibonacci infinite word
- Title not available (Why is that?)
- Squares, cubes, and time-space efficient string searching
- How many squares can a string contain?
- A characterization of the squares in a Fibonacci string
- Beatty Sequences, Continued Fractions, and Certain Shift Operators
- Determination of [nθ] by its Sequence of*Differences
Cited In (21)
- Decision algorithms for Fibonacci-automatic words. I: Basic results.
- Euclidean strings
- Decision algorithms for Fibonacci-automatic words. III: Enumeration and abelian properties.
- Optimality of some algorithms to detect quasiperiodicities
- The numbers of repeated palindromes in the Fibonacci and Tribonacci words
- Asymptotic behaviour of the maximal number of squares in standard Sturmian words
- On the number of frames in binary words
- Powers in Sturmian sequences
- Factorizing strings into repetitions
- Repetitive perhaps, but certainly not boring
- Simple and flexible detection of contiguous repeats using a suffix tree
- Powers in a class of \(\mathcal A\)-strict standard episturmian words
- Repetitions in strings: algorithms and combinatorics
- Squares and primitivity in partial words
- Combinatorial properties of Fibonacci partial words and arrays
- Fast algorithms for finding a minimum repetition representation of strings and trees
- Involutive Fibonacci words
- Corrigendum to: ``The exact number of squares in Fibonacci words
- Two-dimensional Fibonacci words: tandem repeats and factor complexity
- Three overlapping squares: the general case characterized \& applications
- More properties of the Fibonacci word on an infinite alphabet
This page was built for publication: The exact number of squares in Fibonacci words
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1292484)