Pages that link to "Item:Q1292484"
From MaRDI portal
The following pages link to The exact number of squares in Fibonacci words (Q1292484):
Displaying 22 items.
- On the number of frames in binary words (Q719267) (← links)
- Optimality of some algorithms to detect quasiperiodicities (Q986546) (← links)
- Repetitions in strings: algorithms and combinatorics (Q1034529) (← links)
- A characterization of the squares in a Fibonacci string (Q1392029) (← links)
- Euclidean strings (Q1399993) (← links)
- Repetitive perhaps, but certainly not boring (Q1583539) (← links)
- Powers in Sturmian sequences (Q1873773) (← links)
- Factorizing strings into repetitions (Q2135631) (← links)
- Corrigendum to: ``The exact number of squares in Fibonacci words'' (Q2253205) (← links)
- More properties of the Fibonacci word on an infinite alphabet (Q2330118) (← links)
- Squares and primitivity in partial words (Q2341712) (← links)
- Three overlapping squares: the general case characterized \& applications (Q2355701) (← links)
- Powers in a class of \(\mathcal A\)-strict standard episturmian words (Q2373756) (← links)
- The numbers of repeated palindromes in the Fibonacci and Tribonacci words (Q2399293) (← links)
- Fast algorithms for finding a minimum repetition representation of strings and trees (Q2446339) (← links)
- Asymptotic behaviour of the maximal number of squares in standard Sturmian words (Q2909197) (← links)
- Decision Algorithms for Fibonacci-Automatic Words, III: Enumeration and Abelian Properties (Q2974059) (← links)
- Decision algorithms for Fibonacci-automatic Words, I: Basic results (Q3186674) (← links)
- Combinatorial properties of Fibonacci partial words and arrays (Q5034979) (← links)
- (Q5061526) (← links)
- Simple and flexible detection of contiguous repeats using a suffix tree (Q5958334) (← links)
- Two-dimensional Fibonacci words: tandem repeats and factor complexity (Q6107832) (← links)
