On scattered subword complexity

Asa K · 2011

Special scattered subwords, in which the gaps are of length from a given set, are dened. The scattered subword complexity, which is the number of such scattered subwords, is computed for rainbow words.

Read the paper · More papers on PaperTik