A characterization of the squares in a Fibonacci string
From MaRDI portal
Publication:1392029
DOI10.1016/S0304-3975(96)00141-7zbMath0903.68050MaRDI QIDQ1392029
Publication date: 23 July 1998
Published in: Theoretical Computer Science (Search for Journal in Brave)
Related Items (37)
Arithmetics on Suffix Arrays of Fibonacci Words ⋮ Abelian Repetitions in Sturmian Words ⋮ ASYMPTOTIC BEHAVIOUR OF THE MAXIMAL NUMBER OF SQUARES IN STANDARD STURMIAN WORDS ⋮ CROCHEMORE'S REPETITIONS ALGORITHM REVISITED: COMPUTING RUNS ⋮ The number of runs in a string ⋮ The \(D\)-representation of nonnegative integers and the Fibonacci factorization of suffixes of infinite Fibonacci words ⋮ Decision algorithms for Fibonacci-automatic Words, I: Basic results ⋮ The structure of subword graphs and suffix trees of Fibonacci words ⋮ The numbers of repeated palindromes in the Fibonacci and Tribonacci words ⋮ Locating maximal approximate runs in a string ⋮ Large-scale detection of repetitions ⋮ Euclidean strings ⋮ Finding approximate repetitions under Hamming distance. ⋮ On the structure of run-maximal strings ⋮ Unnamed Item ⋮ Locating factors of a characteristic word via the generalized Zeckendorf representation of numbers ⋮ Double string tandem repeats ⋮ Bounds on Powers in Strings ⋮ Maximal repetitions in strings ⋮ A \(d\)-step approach to the maximum number of distinct squares and runs in strings ⋮ Computing the number of cubic runs in standard Sturmian words ⋮ On the density of Lyndon roots in factors ⋮ On the maximum number of cubic subwords in a word ⋮ Shortest covers of all cyclic shifts of a string ⋮ NUMBER OF OCCURRENCES OF POWERS IN STRINGS ⋮ Factors of characteristic words: location and decompositions ⋮ Optimality of some algorithms to detect quasiperiodicities ⋮ Simple and flexible detection of contiguous repeats using a suffix tree ⋮ Counting maximal-exponent factors in words ⋮ Repetitions in strings: algorithms and combinatorics ⋮ Two-pattern strings. I: A recognition algorithm ⋮ The exact number of squares in Fibonacci words ⋮ More properties of the Fibonacci word on an infinite alphabet ⋮ Repetitions in Sturmian strings ⋮ Repetitive perhaps, but certainly not boring ⋮ Three overlapping squares: the general case characterized \& applications ⋮ Locating factors of the infinite Fibonacci word
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An optimal algorithm for computing the repetitions in a word
- A combinatorial property of the Fibonacci words
- Optimal off-line detection of repetitions in a string
- An optimal algorithm to compute all the covers of a string
- An O(n log n) algorithm for finding all repetitions in a string
- Fast Pattern Matching in Strings
- Semantics of context-free languages: Correction
This page was built for publication: A characterization of the squares in a Fibonacci string
