Watson–Crick quantum finite automata

Article Type

Research Article

Publication Title

Acta Informatica

Abstract

One-way quantum finite automata are reversible in nature, which greatly reduces its accepting property. In fact, the set of languages accepted by one-way quantum finite automata is a proper subset of regular languages. In this paper, we replace the tape head of one-way quantum finite automata with DNA double strand and name the model Watson–Crick quantum finite automata. The non-injective complementarity relation of Watson–Crick automata introduces non-determinism in the quantum model. We show that this introduction of non-determinism increases the computational power of one-way quantum finite automata significantly. Watson–Crick quantum finite automata can accept all regular languages and also accepts some languages which are not accepted by any multi-head deterministic finite automata. Exploiting the superposition property of quantum finite automata, we show that Watson–Crick quantum finite automata accept the language L = {ww|w ∈ {a, b}*}.

First Page

231

Last Page

240

DOI

10.1007/s00236-020-00370-x

Publication Date

6-1-2021

Comments

Open Access, Green

This document is currently not available here.

Share

COinS