论文标题
双向纳米级自动机
Two-way Nanoscale automata
论文作者
论文摘要
在本文中，我们显示了双向Watson-Crick Automata的所有最终子类具有与经典的双向Watson-Crick Automata相同的计算能力。在这里，我们比较了双向Watson-Crick Automata和双向量子有限自动机的计算能力，并且我们观察到双向Watson-Crick Automata可以接受双向量子有限自动机无法接受的语言。
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.
