Super-d-complexity of finite words

  title={Super-d-complexity of finite words},
  author={Zolt{\'a}n K{\'a}sa},
In this paper we introduce and study a new complexity measure for finite words. For positive integer d special scattered subwords, called super-d-subwords, in which the gaps are of length at least (d−1), are defined. We give methods to compute super-d-complexity (the total number of different super-d-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… CONTINUE READING


Publications citing this paper.
Showing 1-3 of 3 extracted citations


Publications referenced by this paper.
Showing 1-8 of 8 references

Complexity of categorial time series

  • C. H. Elzinga
  • Sociological Methods & Research, 38, 3
  • 2010
1 Excerpt

On the d-complexity of words

  • A. Iványi
  • Annales Univ. Sci. Budapest., Sect. Computatorica…
  • 1987
1 Excerpt

Physik der Selbstorganisation und Evolution

  • W. Ebeling, R. Feistel
  • Akademie-Verlag, Berlin
  • 1982
1 Excerpt

Similar Papers

Loading similar papers…