A note on the number of squares in a word
From MaRDI portal
Publication:2373759
DOI10.1016/j.tcs.2007.03.025zbMath1119.68141OpenAlexW1992381397MaRDI QIDQ2373759
Publication date: 16 July 2007
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2007.03.025
Related Items (38)
Abelian-square-rich words ⋮ Clusters of repetition roots: single chains ⋮ Words with the Maximum Number of Abelian Squares ⋮ Square-Density Increasing Mappings ⋮ A computational substantiation of the \(d\)-step approach to the number of distinct squares problem ⋮ Maximum number of distinct and nonequivalent nonstandard squares in a word ⋮ ASYMPTOTIC BEHAVIOUR OF THE MAXIMAL NUMBER OF SQUARES IN STANDARD STURMIAN WORDS ⋮ Lower bounds for the number of repetitions in 2D strings ⋮ Distinct squares in run-length encoded strings ⋮ String Powers in Trees ⋮ String powers in trees ⋮ Extracting powers and periods in a word from its runs structure ⋮ On the number of \(k\)-powers in a finite word ⋮ Constructing Words with High Distinct Square Densities ⋮ On shuffled-square-free words ⋮ The three-squares lemma for partial words with one hole ⋮ Density of distinct squares in non-primitive words ⋮ Unnamed Item ⋮ An upper bound of the number of distinct powers in binary words ⋮ On the average number of regularities in a word ⋮ Squares in partial words ⋮ Unnamed Item ⋮ How many double squares can a string contain? ⋮ Maximal repetitions in strings ⋮ Partial words with a unique position starting a square ⋮ A \(d\)-step approach to the maximum number of distinct squares and runs in strings ⋮ Distinct Squares in Circular Words ⋮ A d-Step Approach for Distinct Squares in Strings ⋮ Square network on a word ⋮ On \(k\)-abelian palindromes ⋮ Efficient counting of square substrings in a tree ⋮ On the maximum number of cubic subwords in a word ⋮ Infinite words containing squares at every position ⋮ On the number of squares in partial words ⋮ On the number of frames in binary words ⋮ Repetitions in strings: algorithms and combinatorics ⋮ A note on the number of squares in a partial word with one hole ⋮ Clusters of repetition roots forming prefix chains
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An optimal algorithm for computing the repetitions in a word
- How many squares can a string contain?
- Linear time algorithms for finding and representing all the tandem repeats in a string
- Squares, cubes, and time-space efficient string searching
- A simple proof that a word of length \(n\) has at most \(2n\) distinct squares
This page was built for publication: A note on the number of squares in a word
