Super-d-complexity of finite words
arXiv:1104.4424
Abstract
In this paper we introduce and study a new complexity measure for finite words. For positive integer special scattered subwords, called super--subwords, in which the gaps are of length at least , are defined. We give methods to compute super--complexity (the total number of different super--subwords) in the case of rainbow words (with pairwise different letters) by recursive algorithms, by mahematical formulas and by graph algorithms. In the case of general words, with letters from a given alphabet without any restriction, the problem of the maximum value of the super--complexity of all words of length is presented.