Non-regular unary language and parallel communicating Watson-Crick automata systems
Formal Languages and Automata Theory
2015-10-08 v1
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.
Cite
@article{arxiv.1510.02070,
title = {Non-regular unary language and parallel communicating Watson-Crick automata systems},
author = {Kingshuk Chatterjee and Kumar Sankar Ray},
journal= {arXiv preprint arXiv:1510.02070},
year = {2015}
}
Comments
arXiv admin note: text overlap with arXiv:1507.05284