3 citations · 4 across the 6 of their papers we have counts for
6 papers · 1 filter
2-Head 2D Returning Finite Automata
Henning Fernau, Benedek Nagy, R. Jennifer Rose +2
We introduce and study a family of two-head finite automata called two head returning finite automata (2-HRFA) operating on rectangular arrays of picture languages, in which both h…
On some Classes of Reversible 2-head Automata
Benedek Nagy, Walaa Yasin
Deterministic 2-head finite automata which are machines that process an input word from both ends are analyzed for their ability to perform reversible computations. This implies th…
A Myhill-Nerode Type Characterization of 2detLIN Languages
Benedek Nagy
Linear automata are automata with two reading heads starting from the two extremes of the input, are equivalent to 5' -> 3' Watson-Crick (WK) finite automata. The heads read the in…
5' -> 3' Watson-Crick Automata accepting Necklaces
Benedek Nagy
Watson-Crick (WK) finite automata work on a Watson-Crick tape representing a DNA molecule. They have two reading heads. In 5'->3' WK automata, the heads move and read the input in…
Proceedings of the 13th International Workshop on Non-Classical Models of Automata and Applications
Benedek Nagy, Rudolf Freund
The Thirteenth International Workshop on Non-Classical Models of Automata and Applications (NCMA 2023) was held in Famagusta, North Cyprus, on September 18 and 19, 2023, organized…
State-deterministic Finite Automata with Translucent Letters and Finite Automata with Nondeterministically Translucent Letters
Benedek Nagy
Deterministic and nondeterministic finite automata with translucent letters were introduced by Nagy and Otto more than a decade ago as Cooperative Distributed systems of a kind of…