7 citations · 15 across the 3 of their papers we have counts for
3 papers
cs.FL2022★ 4 cited
Quasi-deterministic 5' -> 3' Watson-Crick Automata
Benedek Nagy
Watson-Crick (WK) finite automata are working on a Watson-Crick tape, that is, on a DNA molecule. A double stranded DNA molecule contains two strands, each having a 5' and a 3' end…
cs.DS2014★ 4 cited
Computing discrete logarithm by interval-valued paradigm
Benedek Nagy, Sándor Vályi
Interval-valued computing is a relatively new computing paradigm. It uses finitely many interval segments over the unit interval in a computation as data structure. The satisfiabil…
math.MG2010★ 7 cited
Approximating the Euclidean circle in the square grid using neighbourhood sequences
Janos Farkas, Szabolcs Bajak, Benedek Nagy
Distance measuring is a very important task in digital geometry and digital image processing. Due to our natural approach to geometry we think of the set of points that are equally…