Complexity for Finite Factors of Infinite Sequences. - Sébastien Ferenczi; Zoltán Kása (Theor. Comput. Sci., 1999)

Generating and ranking of Dyck words - Zoltán Kása (CoRR, 2010)

On the d-complexity of strings - Zoltán Kása (CoRR, 2010)

Properties of palindromes in finite words - Mira-Cristiana Anisiu; Valeriu Anisiu; Zoltán Kása (CoRR, 2010)

Maximal Complexity of Finite Words - Mira-Cristiana Anisiu; Zoltán Blázsik; Zoltán Kása (CoRR, 2010)

Coding objects related to Catalan numbers - Antal Bege; Zoltán Kása (CoRR, 2010)

On arc-disjoint Hamiltonian cycles in De Bruijn graphs - Zoltán Kása (CoRR, 2010)

Total palindrome complexity of finite words. - Mira-Cristiana Anisiu; Valeriu Anisiu; Zoltán Kása (Discret. Math., 2010)

Binary trees and number of states in buddy systems - Zoltán Kása; Leoan Tâmbulea (CoRR, 2011)

Super-d-complexity of finite words - Zoltán Kása (CoRR, 2011)

On scattered subword complexity - Zoltán Kása (CoRR, 2011)

Warshall's algorithm - survey and applications. - Zoltán Kása (CoRR, 2019)

Order in the chaos with examples from graph theory. - Zoltán Kása (CoRR, 2021)