Zoltán Kása

Executive editor, Professor
Mathematics and Informatics
Sapientia Hungarian University of Transylvania
E-mail: kasa@ms.sapientia.ro
Page: http://www.ms.sapientia.ro/~kasa

Fields of interest:

Theoretical computer sciences, Combinatorics,

Recent publications:

Papers:

A. Iványi, Z. Kása:
Prism complexity of matrices,
Annales Univ. Sci. Budapest., Sect. Comp. 39 (2013) 181–202.

Z. Kása, Z. Kátai,
Scattered subwords and composition of naturals,
Acta Univ. Sapientiae, Informatica, 4, 2 (2012) 225−236

Z. Kása,
On scattered subword complexity,
Acta Univ. Sapientiae, Informatica, 3, 1 (2011) 127−136.

Anisiu, M-C., Anisiu, V., Kása, Z.,
Total palindrome complexity of finite words,
Discrete Mathematics, 310 (2010) 109–114

Z. Kása,
Super-d-complexity of finite words,
8th Joint Conf. on Math. and Computer Science, MACS 2010, July 14–17, 2010., Komárno, Selected Papers, pp. 257–266. Novadat, 2011.

Book chapters:

Algorithms of Informatics, III. Selected topics (ed. A. Iványi) ,mondAt Kiadó, Budapest,2013. (Chapter 25. Kása Z., M.–C. Anisiu: Complexity of words, pp.1237–1289. ISBN 978-963-87596-7-2.

Informatikai algoritmusok III. (ed. A. Iványi), mondAt Kiadó, Budapest,2013. (Chapter 34. Kása Z., M.–C. Anisiu: Szavak bonyolultsága, pp.1697–1739. ISBN 978-963-87596-8-9. (In Hungarian)