On the d-complexity of strings
Discrete Mathematics
2010-02-16 v1
Abstract
This paper deals with the complexity of strings, which play an important role in biology (nucleotid sequences), information theory and computer science. The d-complexity of a string is defined as the number of its distinct d-substrings given in Definition 1. The case d=1 is studied in detail.
Cite
@article{arxiv.1002.2721,
title = {On the d-complexity of strings},
author = {Zoltan Kasa},
journal= {arXiv preprint arXiv:1002.2721},
year = {2010}
}