String powers in trees
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1024080 (Why is no real title available?)
- 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
- Algorithms on Strings
- Efficient counting of square substrings in a tree
- Episturmian words and some constructions of de Luca and Rauzy
- Finding all periods and initial palindromes of a string in parallel
- How many double squares can a string contain?
- How many squares can a string contain?
- Maximum Number of Distinct and Nonequivalent Nonstandard Squares in a Word
- Nonrepetitive colorings of trees
- On the maximum number of cubic subwords in a word
- Palindromic complexity of trees
- Pattern Matching in Hypertext
- String Powers in Trees
- The maximum number of squares in a tree
- Thue type problems for graphs, points, and numbers
- Tight bound for the number of distinct palindromes in a tree
Cited in
(12)- Efficiently computing runs on a trie
- String Powers in Trees
- Bounds on Powers in Strings
- Efficient counting of square substrings in a tree
- Lower bounds for the number of repetitions in 2D strings
- String covers of a tree
- Tight bound for the number of distinct palindromes in a tree
- NUMBER OF OCCURRENCES OF POWERS IN STRINGS
- The maximum number of squares in a tree
- Computing runs on a trie
- scientific article; zbMATH DE number 2087487 (Why is no real title available?)
- String covers of a tree revisited
This page was built for publication: String powers in trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1679231)
