2015/10/07 by Kingshuk Chatterjee, Chatterjee, Kingshuk, Kumar S. Ray +1
Biochemistry, Genetics and Molecular Biology · Computer Science · #Advanced biosensing and bioanalysis techniques #DNA and Biological Computing #FOS: Computer and information sciences #Formal Languages and Automata Theory (cs.FL) #semigroups and automata theory
paper · pdf · doi:10.48550/arxiv.1510.02070
openalex publication_date 2015/10/07 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In 2006, Czeizler et.al. introduced parallel communicating Watson-Crick\nautomata system. They showed that parallel communicating Watson-Crick automata\nsystem can accept the non-regular unary language L=a^(n2 ),where n>1 using\nnon-injective complementarity relation and three components. In this paper, we\nimprove on Czeizler et.al. work by showing that parallel communicating\nWatson-Crick automata system can accept the same language L using just two\ncomponents.\n