3 citations · 4 across the 6 of their papers we have counts for
Showing 2025Show all
2 papers · 1 filter
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…