Reversible Watson–Crick automata

Authors

Kingshuk Chatterjee, Indian Statistical Institute, Kolkata
Kumar Sankar Ray, Indian Statistical Institute, Kolkata

Article Type

Research Article

Publication Title

Acta Informatica

Abstract

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.

First Page

487

Last Page

499

DOI

10.1007/s00236-016-0267-0

Publication Date

8-1-2017

Comments

Open Access, Green

Recommended Citation

Chatterjee, Kingshuk and Ray, Kumar Sankar, "Reversible Watson–Crick automata" (2017). Journal Articles. 2486.
https://digitalcommons.isical.ac.in/journal-articles/2486