36 citations · 78 across the 32 of their papers we have counts for
Showing cs.FLShow all
2 papers · 1 filter
cs.FL2017
Two strings at Hamming distance 1 cannot be both quasiperiodic
Amihood Amir, Costas S. Iliopoulos, Jakub Radoszewski
We present a generalization of a known fact from combinatorics on words related to periodicity into quasiperiodicity. A string is called periodic if it has a period which is at mos…
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…