2 citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
Showing cs.DMShow all
2 papers · 1 filter
cs.DM2011
On scattered subword complexity
Zoltán Kása
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 comp…
cs.DM2011★ 2 cited
Super-d-complexity of finite words
Zoltán Kása
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 ar…