6 citations · 18 across the 10 of their papers we have counts for
11 papers
Order in the chaos with examples from graph theory
Zoltán Kása
In randomly created structures (be they natural or artificial) very often there exist ordered substructures. In this Hungarian language scientific essay we will present some of suc…
Warshall's algorithm -- survey and applications
Zoltán Kása
The survey presents the well-known Warshall's algorithm, a generalization and some interesting applications of this.
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…
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…
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…
Coding objects related to Catalan numbers
Antal Bege, Zoltán Kása
A coding method using binary sequences is presented for different computation problems related to Catalan numbers. This method proves in a very easy way the equivalence of these pr…