Deterministic parallel communicating Watson-Crick automata systems

TL;DR

This paper introduces a deterministic variant of Watson-Crick automata systems, demonstrating their ability to recognize certain non-regular languages and comparing their computational power with other automata models.

Contribution

It presents the first deterministic Watson-Crick automata systems, analyzing their recognition capabilities and their relation to other automata models.

Findings

Deterministic Watson-Crick automata can recognize some non-regular uniletter languages.

Deterministic and strongly deterministic Watson-Crick automata systems are incomparable in computational power.

The computational ability of these systems is compared with multihead finite automata and parallel communicating finite automata.

Abstract

In this paper, we have introduced the deterministic variant of parallel communicating Watson-Crick automata systems. We show that similar to the non-deterministic version, the deterministic version can also recognise some non-regular uniletter languages. We further establish that strongly deterministic Watson-Crick automata systems and deterministic Watson-Crick automata system are incomparable in terms of their computational ability. We have also compared the computational ability of our system with multihead finite automata and parallel communicating finite automata systems.