Non-regular unary language and parallel communicating Watson-Crick automata systems

TL;DR

This paper improves the efficiency of parallel communicating Watson-Crick automata systems by demonstrating they can accept a specific non-regular unary language with only two components, reducing complexity from previous work.

Contribution

It shows that the same non-regular unary language can be accepted with fewer components, specifically reducing from three to two, using non-injective complementarity relations.

Findings

Accepted the language with two components

Reduced the number of components needed

Extended understanding of automata capabilities

Abstract

In 2006, Czeizler et.al. introduced parallel communicating Watson-Crick automata system. They showed that parallel communicating Watson-Crick automata system can accept the non-regular unary language L={a^(n^2 ),where n>1} using non-injective complementarity relation and three components. In this paper, we improve on Czeizler et.al. work by showing that parallel communicating Watson-Crick automata system can accept the same language L using just two components.