Multi-head Watson-Crick quantum finite automata

TL;DR

This paper introduces a multi-head Watson-Crick quantum finite automaton, demonstrating its superior computational power over classical multi-head automata and its ability to accept languages beyond deterministic automata capabilities.

Contribution

The paper presents a novel multi-head Watson-Crick quantum finite automaton and proves its enhanced computational power over existing automata models.

Findings

Multi-head Watson-Crick quantum automata are more powerful than one-way multi-head reversible finite automata.

They can accept languages not recognized by any one-way multi-head deterministic finite automata.

The automaton combines DNA-inspired and quantum computational properties.

Abstract

Watson-Crick quantum finite automata were introduced by Ganguly et.al. by combining properties of DNA and Quantum automata. In this paper we introduce a multi-head version of the above automaton. We further show that the multi-head variant is computationally more powerful than one-way multi-head reversible finite automata. In fact we also show that the multi-head variant accepts a language which is not accepted by any one-way multi-head deterministic finite automata.