2 citations · 2 across the 3 of their papers we have counts for
3 papers
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…
cs.DM2011
Binary trees and number of states in buddy systems
Zoltán Kása, Leoan Tâmbulea
In the paper are computed: the number of binary trees with n nodes and k leaves; the number of leaves in the set of all binary trees with n nodes. These are used to compute the num…