Restricted deterministic Watson-Crick automata

TL;DR

This paper introduces a restricted deterministic Watson-Crick automaton model where the lower strand's complementarity string is limited to a language L, analyzing its computational power across various language classes.

Contribution

It defines a new restricted automaton model and compares its computational capabilities to existing Watson-Crick automata across different language classes.

Findings

Power matches deterministic Watson-Crick automata when L is regular.

Accepted languages with L in unary regular are a subset of context-free languages.

The model's computational power varies with the class of language L.

Abstract

In this paper, we introduce a new model of deterministic Watson-Crick automaton namely restricted deterministic Watson- Crick automaton which is a deterministic Watson-Crick automaton where the complementarity string in the lower strand is restricted to a language L. We examine the computational power of the restricted model with respect to L being in different language classes such as regular, unary regular, finite, context free and context sensitive. We also show that computational power of restricted deterministic Watson- Crick automata with L in regular languages is same as that of deterministic Watson-Crick automata and that the set of all languages accepted by restricted deterministic Watson-Crick automata with L in unary regular languages is a proper subset of context free languages.