Multi-head Watson–Crick automata

Article Type

Research Article

Publication Title

International Journal of Computer Mathematics: Computer Systems Theory

Abstract

Inspired by multi-head finite automata and Watson–Crick automata, in this paper, we introduce a new structure, namely multi-head Watson–Crick automata, where we replace the single tape of a multi-head finite automaton by a DNA double strand. The content of the second tape is determined using a complementarity relation similar to the Watson–Crick complementarity relation. We establish the superiority of our model over multi-head finite automata and also show that both the deterministic and non-deterministic variants of the model can accept non-regular unary languages. We also compare our model with parallel communicating Watson–Crick automata systems and prove that both of them have the same computational power.

First Page

57

Last Page

73

DOI

10.1080/23799927.2016.1246477

Publication Date

4-2-2016

Comments

Open Access; Green Open Access

Share

COinS