On scattered subword complexity
Z Kása - arXiv preprint arXiv:1104.4425, 2011 - arxiv.org
arXiv preprint arXiv:1104.4425, 2011•arxiv.org
arXiv:1104.4425v1 [cs.DM] 22 Apr 2011 Page 1 arXiv:1104.4425v1 [cs.DM] 22 Apr 2011 Acta
Univ. Sapientiae, Informatica, 3, 1 (2011) 127–136 On scattered subword complexity Zoltán
KASA Sapientia Hungarian University of Transylvania Department of Mathematics and
Informatics, Tg. Mures, Romania email: kasa@ms.sapientia.ro 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. 1 …
Univ. Sapientiae, Informatica, 3, 1 (2011) 127–136 On scattered subword complexity Zoltán
KASA Sapientia Hungarian University of Transylvania Department of Mathematics and
Informatics, Tg. Mures, Romania email: kasa@ms.sapientia.ro 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. 1 …
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.
arxiv.org