2 citations
7 papers
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…
Generalized GCD matrices
Antal Bege
Let be an arithmetical function. The matrix given by the value of in greatest common divisor of , as its entry is…
Modelling dynamic programming problems by generalized d-graphs
Zoltán Kátai
In this paper we introduce the concept of generalized d-graph (admitting cycles) as special dependency-graphs for modelling dynamic programming (DP) problems. We describe the d-gra…
Generalized perfect numbers
Antal Bege, Kinga Fogarasi
In this paper some new ways of generalizing perfect numbers are investigated, numerical results are presented and some conjectures are established.
Public-key cryptography in functional programming context
Gyöngyvér Márton
Up to now, for efficiency reasons cryptographic algorithm has been written in an imperative language. But to get acquaintance with a functional programming language a question aris…