6 citations · 18 across the 10 of their papers we have counts for
6 papers · 1 filter
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…
On arc-disjoint Hamiltonian cycles in De Bruijn graphs
Zoltán Kása
We give two equivalent formulations of a conjecture [2,4] on the number of arc-disjoint Hamiltonian cycles in De Bruijn graphs.
Maximal Complexity of Finite Words
M-C. Anisiu, Z. Blazsik, Z. Kasa
The subword complexity of a finite word of length is a function which associates to each the number of all distinct subwords of having the length . We defin…
Properties of palindromes in finite words
M-C. Anisiu, V. Anisiu, Z. Kasa
We present a method which displays all palindromes of a given length from De Bruijn words of a certain order, and also a recursive one which constructs all palindromes of length $n…
On the d-complexity of strings
Zoltan Kasa
This paper deals with the complexity of strings, which play an important role in biology (nucleotid sequences), information theory and computer science. The d-complexity of a strin…
Generating and ranking of Dyck words
Zoltan Kasa
A new algorithm to generate all Dyck words is presented, which is used in ranking and unranking Dyck words. We emphasize the importance of using Dyck words in encoding objects rela…