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

Authors

Kingshuk Chatterjee, Indian Statistical Institute, Kolkata
Kumar Sankar Ray, Indian Statistical Institute, Kolkata

Article Type

Research Article

Publication Title

Theoretical Computer Science

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={an2, where n>1} using non-injective complementarity relation and three components. In this paper, we improve on Czeizler et al.'s work by showing that parallel communicating Watson–Crick automata system can accept the same language L using just two components.

First Page

113

Last Page

117

DOI

10.1016/j.tcs.2017.09.008

Publication Date

1-1-2018

Comments

All Open Access, Bronze, Green

Recommended Citation

Chatterjee, Kingshuk and Ray, Kumar Sankar, "Non-regular unary language and parallel communicating Watson–Crick automata systems" (2018). Journal Articles. 1620.
https://digitalcommons.isical.ac.in/journal-articles/1620