On scattered subword complexity
Discrete Mathematics
2011-04-25 v1
Abstract
Special scattered subwords, in which the gaps are of length from a given set, are defined. The scattered subword complexity, which is the number of such scattered subwords, is computed for rainbow words.
Keywords
Cite
@article{arxiv.1104.4425,
title = {On scattered subword complexity},
author = {Zoltán Kása},
journal= {arXiv preprint arXiv:1104.4425},
year = {2011}
}