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…