3 papers
cs.FL2026
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…
cs.FL2025
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…
cs.FL2025
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…