Two-way Nanoscale automata
Formal Languages and Automata Theory
2020-05-18 v1
Abstract
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.
Keywords
Cite
@article{arxiv.2005.07569,
title = {Two-way Nanoscale automata},
author = {Debayan Ganguly and Kingshuk Chatterjee and Kumar Sankar Ray},
journal= {arXiv preprint arXiv:2005.07569},
year = {2020}
}