A characterization of the squares in a Fibonacci string
From MaRDI portal
Recommendations
Cites work
- A combinatorial property of the Fibonacci words
- An O(n log n) algorithm for finding all repetitions in a string
- An optimal algorithm for computing the repetitions in a word
- An optimal algorithm to compute all the covers of a string
- Fast Pattern Matching in Strings
- scientific article; zbMATH DE number 3824103 (Why is no real title available?)
- scientific article; zbMATH DE number 1052825 (Why is no real title available?)
- scientific article; zbMATH DE number 1142294 (Why is no real title available?)
- scientific article; zbMATH DE number 1151822 (Why is no real title available?)
- scientific article; zbMATH DE number 871172 (Why is no real title available?)
- Optimal off-line detection of repetitions in a string
- Semantics of context-free languages: Correction
Cited in
(49)- Repetitions in strings: algorithms and combinatorics
- The exact number of squares in Fibonacci words
- Euclidean strings
- Finding approximate repetitions under Hamming distance.
- Fibonacci arrays and their two-dimensional repetitions
- Repetitions in Sturmian strings
- Repetitive perhaps, but certainly not boring
- On the maximum number of cubic subwords in a word
- Two-pattern strings. I: A recognition algorithm
- More properties of the Fibonacci word on an infinite alphabet
- Three overlapping squares: the general case characterized \& applications
- The number of runs in a string
- The numbers of repeated palindromes in the Fibonacci and Tribonacci words
- Locating maximal approximate runs in a string
- The \(D\)-representation of nonnegative integers and the Fibonacci factorization of suffixes of infinite Fibonacci words
- Double string tandem repeats
- Asymptotic behaviour of the maximal number of squares in standard Sturmian words
- Crochemore's repetitions algorithm revisited: computing runs
- Large-scale detection of repetitions
- Quasiperiodicities in Fibonacci strings.
- Decision algorithms for Fibonacci-automatic words. I: Basic results.
- Arithmetics on suffix arrays of Fibonacci words
- Bounds on Powers in Strings
- NUMBER OF OCCURRENCES OF POWERS IN STRINGS
- On the structure of run-maximal strings
- scientific article; zbMATH DE number 1151822 (Why is no real title available?)
- Locating factors of a characteristic word via the generalized Zeckendorf representation of numbers
- scientific article; zbMATH DE number 871172 (Why is no real title available?)
- 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
- Involutive Fibonacci words
- On the density of Lyndon roots in factors
- Abelian repetitions in Sturmian words
- The number of repetitions in 2D-strings
- SOFSEM 2006: Theory and Practice of Computer Science
- Shortest covers of all cyclic shifts of a string
- Simple and flexible detection of contiguous repeats using a suffix tree
- SQUARE COMPLETION OPERATION OF MAXIMAL SUFFIX IN FIBONACCI WORD
- Largest repetition factorization of Fibonacci words
- Exact and inexact search for 2d side-sharing tandems
- Exploiting new properties of string net frequency for efficient computation
- Counting maximal-exponent factors in words
- Net occurrences in Fibonacci and Thue-Morse words
- A note on convex characters, Fibonacci numbers and exponential-time algorithms
- Locating factors of the infinite Fibonacci word
- The structure of subword graphs and suffix trees of Fibonacci words
- Maximal repetitions in strings
- Factors of characteristic words: location and decompositions
- Optimality of some algorithms to detect quasiperiodicities
This page was built for publication: A characterization of the squares in a Fibonacci string
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1392029)
