2015/07/19 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.1507.05284
openalex publication_date 2015/07/19 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.