Reversible Watson–Crick automata
Since 1970, reversible finite automata have generated interest among researcher; but till now, we have not come across a model of reversible read only one-way finite automata which accept all regular languages, In this paper, we introduce a new model of one-way reversible finite automata inspired by the Watson–Crick complementarity relation and show that our model can accept all regular languages. We further show that our model accepts a language which is not accepted by any multi-head deterministic finite automaton.
Chatterjee, Kingshuk and Ray, Kumar Sankar, "Reversible Watson–Crick automata" (2017). Journal Articles. 2486.