3 citations · 3 across the 1 of their papers we have counts for
3 papers
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…
cs.FL2024★ 3 cited
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…