Benedek Nagy

Prof. Benedek Nagy

orcid

Research Focus & Metrics

Academic Career Length

17Years (2010-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
9 February 2019 in Symmetry
Verified
Journal Article
Open access
PDF file
BNBenedek Nagy
Benedek Nagy
KAKHALED ABUHMAIDAN
KHALED ABUHMAIDAN
The concept of the grid is broadly used in digital geometry and other fields of computer science. It consists of discrete points with integer coordinates. Coordinate systems are essential for making grids easy to use. Up to now, for the triangular grid, only discrete coordinate systems have been investigated. These have limited capabilities for some image-processing applications, including transformations like rotations or interpolation. In this paper, we introduce the continuous triangular coordinate system as an extension of the discrete triangular and hexagonal coordinate systems. The new system addresses each point of the plane with a coordinate triplet. Conversion between the Cartesian coordinate system and the new system is described. The sum of three coordinate values lies in the closed interval [−1, 1], which gives many other vital properties of this coordinate system.

17 April 2018 in IEEE Access
Verified
Journal Article
Open access
MAMohsen Abdalla
Mohsen Abdalla
BNBenedek Nagy
Benedek Nagy
In this paper, a new idea for morphological operations, i.e., dilation and erosion on the regular triangular tessellation is presented. The triangles have two orientations; they are addressed by zero-sum and one-sum triplets and called even and odd pixels, respectively. The triangular grid is not a lattice, that is, there are grid vectors that do not translate the grid to itself. Different sets of vectors translate the even and odd pixels into the grid: for even pixels vectors with sum 0 and 1 can be used, while for odd pixels vectors with sum 0 and –1 are appropriate. Based on this fact, we introduce a technique in which one can work “independently” with the even and the odd pixels in morphological operations. Examples and various properties of the “independent” dilation and erosion are analyzed.

1 January 2010 in Fundamenta Informaticae
Verified
Journal Article
Closed access
PDF file
PLPeter Leupold
Peter Leupold
BNBenedek Nagy
Benedek Nagy
5′ → 3′ WK-automata are Watson-Crick automata whose two heads start on opposite ends of the input word and always run in opposite directions. One full reading in both directions is called a run. We prove that the expressive power of these automata in

1 June 2013 in International Journal of Computer Mathematics
Verified
Journal Article
Open access
BNBenedek Nagy
Benedek Nagy
FOFriedrich Otto
Friedrich Otto
It is known that cooperating distributed systems (CD-systems) of stateless deterministic restarting automata with window size 1 accept a class of semi-linear languages that properly includes all rational trace languages. Although the component automata of such a CD-system are all deterministic, the CD-system itself is not. Here, we study CD-systems of stateless deterministic restarting automata with window size 1 that are themselves completely deterministic. In fact, we consider two such types of CD-systems: the strictly deterministic systems and the globally deterministic systems.

6 January 2020 in Acta Informatica
Verified
Journal Article
Closed access
PDF file
BNBenedek Nagy
Benedek Nagy
SPShaghayegh Parchami
Shaghayegh Parchami

21 August 2017 in Electronic Proceedings in Theoretical Computer Science
Verified
Journal Article
Open access
PDF file
BNBenedek Nagy
Benedek Nagy
SPShaghayegh Parchami
Shaghayegh Parchami
HMHamid Mir-Mohammad-Sadeghi
Hamid Mir-Mohammad-Sadeghi
Watson-Crick (WK) finite automata are working on a Watson-Crick tape, that is, on a DNA molecule. Therefore, it has two reading heads. While in traditional WK automata both heads read the whole input in the same physical direction, in 5'->3' WK automata the heads start from the two extremes and read the input in opposite direction. In sensing 5'->3' WK automata the process on the input is finished when the heads meet. Since the heads of a WK automaton may read longer strings in a transition, in previous models a so-called sensing parameter took care for the proper meeting of the heads (not allowing to read the same positions of the input in the last step). In this paper, a new model is investigated, which works without the sensing parameter (it is done by an appropriate change of the concept of configuration). Consequently, the accepted language classes of the variants are also changed. Various hierarchy results are proven in the paper.Comment: In Proceedings AFL 2017, arXiv:1708.0622