36 citations · 92 across the 24 of their papers we have counts for
Showing cs.FLShow all
2 papers · 1 filter
cs.FL2015★ 14 cited
Testing k-binomial equivalence
Dominik D. Freydenberger, Pawel Gawrychowski, Juhani Karhumäki +2
Two words and are said to be -binomial equivalent if every non-empty word of length at most over the alphabet of and appears as a scattered facto…
cs.FL2009★ 8 cited
On the maximal number of cubic subwords in a string
Marcin Kubica, Jakub Radoszewski, Wojciech Rytter +1
We investigate the problem of the maximum number of cubic subwords (of the form ) in a given word. We also consider square subwords (of the form ). The problem of the maxi…