15 citations · 34 across the 7 of their papers we have counts for
7 papers
On Languages Generated by Signed Grammars
Ömer Eğecioğlu, Benedek Nagy
We consider languages defined by signed grammars which are similar to context-free grammars except productions with signs associated to them are allowed. As a consequence, the word…
Counting of Shortest Paths in Cubic Grid
Mousumi Dutt, Arindam Biswas, Benedek Nagy
The enumeration of shortest paths in cubic grid is presented herein, which could have importance in image processing and also in the network sciences. The cubic grid considers thre…
A New Sensing 5'-->3' Watson-Crick Automata Concept
Benedek Nagy, Shaghayegh Parchami, 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 r…
Representations of Circular Words
László Hegedüs, Benedek Nagy
In this article we give two different ways of representations of circular words. Representations with tuples are intended as a compact notation, while representations with trees gi…
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…
Pumping lemmas for linear and nonlinear context-free languages
Géza Horváth, Benedek Nagy
Pumping lemmas are created to prove that given languages are not belong to certain language classes. There are several known pumping lemmas for the whole class and some special cla…