Pages that link to "Item:Q1392029"

The following pages link to A characterization of the squares in a Fibonacci string (Q1392029):

Displaying 39 items.

• On the structure of run-maximal strings (Q414413) (← links)
• Locating factors of a characteristic word via the generalized Zeckendorf representation of numbers (Q441880) (← links)
• A \(d\)-step approach to the maximum number of distinct squares and runs in strings (Q496539) (← links)
• Computing the number of cubic runs in standard Sturmian words (Q496558) (← links)
• On the density of Lyndon roots in factors (Q507403) (← links)
• Counting maximal-exponent factors in words (Q728262) (← links)
• Locating factors of the infinite Fibonacci word (Q817818) (← links)
• The structure of subword graphs and suffix trees of Fibonacci words (Q860864) (← links)
• Maximal repetitions in strings (Q931723) (← links)
• Factors of characteristic words: location and decompositions (Q982654) (← links)
• Optimality of some algorithms to detect quasiperiodicities (Q986546) (← links)
• Repetitions in strings: algorithms and combinatorics (Q1034529) (← links)
• The exact number of squares in Fibonacci words (Q1292484) (← links)
• Euclidean strings (Q1399993) (← links)
• Finding approximate repetitions under Hamming distance. (Q1401359) (← links)
• Repetitions in Sturmian strings (Q1583533) (← links)
• Repetitive perhaps, but certainly not boring (Q1583539) (← links)
• On the maximum number of cubic subwords in a word (Q1761496) (← links)
• Two-pattern strings. I: A recognition algorithm (Q1827270) (← links)
• More properties of the Fibonacci word on an infinite alphabet (Q2330118) (← links)
• Three overlapping squares: the general case characterized \& applications (Q2355701) (← links)
• The number of runs in a string (Q2381507) (← links)
• The numbers of repeated palindromes in the Fibonacci and Tribonacci words (Q2399293) (← links)
• Locating maximal approximate runs in a string (Q2410363) (← links)
• The \(D\)-representation of nonnegative integers and the Fibonacci factorization of suffixes of infinite Fibonacci words (Q2636829) (← links)
• Double string tandem repeats (Q2700385) (← links)
• ASYMPTOTIC BEHAVIOUR OF THE MAXIMAL NUMBER OF SQUARES IN STANDARD STURMIAN WORDS (Q2909197) (← links)
• CROCHEMORE'S REPETITIONS ALGORITHM REVISITED: COMPUTING RUNS (Q2909203) (← links)
• Large-scale detection of repetitions (Q2955637) (← links)
• Decision algorithms for Fibonacci-automatic Words, I: Basic results (Q3186674) (← links)
• Arithmetics on Suffix Arrays of Fibonacci Words (Q3449364) (← links)
• Bounds on Powers in Strings (Q3533012) (← links)
• NUMBER OF OCCURRENCES OF POWERS IN STRINGS (Q3586403) (← links)
• Abelian Repetitions in Sturmian Words (Q5300843) (← links)
• (Q5874500) (← links)
• Shortest covers of all cyclic shifts of a string (Q5925516) (← links)
• Simple and flexible detection of contiguous repeats using a suffix tree (Q5958334) (← links)
• Largest repetition factorization of Fibonacci words (Q6545438) (← links)
• Exact and inexact search for 2d side-sharing tandems (Q6658301) (← links)