2020/04/19 by Debayan Ganguly, Ganguly, Debayan, Kingshuk Chatterjee +3
Computer Science · Engineering · #FOS: Computer and information sciences #Formal Languages and Automata Theory (cs.FL) #Molecular Junctions and Nanostructures #Quantum Computing Algorithms and Architecture #Quantum-Dot Cellular Automata
paper · pdf · doi:10.48550/arxiv.2005.07569
openalex publication_date 2020/04/19 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In this paper, we show the all final subclass of two-way Watson-Crick automata have the same computational power as the classical two-way Watson-Crick automata. Here we compare the computational power of two-way Watson-Crick automata and two-way Quantum finite automata and we observe that two-way Watson-Crick automata can accept a language which two-way quantum finite automata cannot accept.