Clusters of repetition roots: single chains
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1024080 (Why is no real title available?)
- A generalization of Thue freeness for partial words
- A note on the number of squares in a word
- A simple proof that a word of length \(n\) has at most \(2n\) distinct squares
- A stronger square conjecture on binary words
- Algorithms on Strings, Trees and Sequences
- Avoiding large squares in infinite binary words
- Counting distinct squares in partial words
- How many double squares can a string contain?
- How many squares can a string contain?
- How many squares must a binary sequence contain?
- Maximum number of distinct and nonequivalent nonstandard squares in a word
- NUMBER OF OCCURRENCES OF POWERS IN STRINGS
- On repetitions of blocks in binary sequences
- Prefix frequency of lost positions
- Squares, cubes, and time-space efficient string searching
- The ``runs theorem
- The maximal number of cubic runs in a word
This page was built for publication: Clusters of repetition roots: single chains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q831839)