The exact number of squares in Fibonacci words

DOI10.1016/S0304-3975(98)00252-7MaRDI QIDQ1292484zbMATHFDO

Authors Aviezri S. Fraenkel, Jamie Simpson

Publication date 21 June 1999

Published in Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

repetitionssquaresFibonacci words

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Recommendations

• A characterization of the squares in a Fibonacci string
• The numbers of repeated palindromes in the Fibonacci and Tribonacci words
• Fibonacci numbers and words
• Repetitions in the Fibonacci infinite word

Cites work

• scientific article; zbMATH DE number 801745 (Why is no real title available?)
• scientific article; zbMATH DE number 3299758 (Why is no real title available?)
• A characterization of the squares in a Fibonacci string
• A combinatorial theorem on $p$-power-free words and an application to semigroups
• An optimal algorithm for computing the repetitions in a word
• Beatty Sequences, Continued Fractions, and Certain Shift Operators
• Determination of [nθ] by its Sequence of^*Differences
• How many squares can a string contain?
• Repetitions in the Fibonacci infinite word
• Squares, cubes, and time-space efficient string searching

Cited in

(21)

• Three overlapping squares: the general case characterized \& applications
• Euclidean strings
• Squares and primitivity in partial words
• Optimality of some algorithms to detect quasiperiodicities
• Combinatorial properties of Fibonacci partial words and arrays
• More properties of the Fibonacci word on an infinite alphabet
• The numbers of repeated palindromes in the Fibonacci and Tribonacci words
• Factorizing strings into repetitions
• Decision algorithms for Fibonacci-automatic words. I: Basic results.
• Fast algorithms for finding a minimum repetition representation of strings and trees
• Involutive Fibonacci words
• Simple and flexible detection of contiguous repeats using a suffix tree
• On the number of frames in binary words
• Two-dimensional Fibonacci words: tandem repeats and factor complexity
• Decision algorithms for Fibonacci-automatic words. III: Enumeration and abelian properties.
• Repetitive perhaps, but certainly not boring
• Asymptotic behaviour of the maximal number of squares in standard Sturmian words
• Powers in Sturmian sequences
• Powers in a class of \(\mathcal A\)-strict standard episturmian words
• Repetitions in strings: algorithms and combinatorics
• Corrigendum to: ``The exact number of squares in Fibonacci words

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)