干涉自动机
Interference Automata
摘要：
我们提出了一个计算模型，双向光学干涉自动机（2 OIA），利用光学干涉现象。我们引入这个模型来研究增加的权力，在语言识别方面，一个经典的确定性有限自动机（DFA）时，赋予光干涉的设施。这个问题是在双向有限自动机与量子和经典状态（2 QCFA）的精神[A。Ambainis和J. Watrous，Two-way Finite Automata With Quantum and Classical States，Theoretical计算机科学，287（1），299-311，（2002）]，其中经典DFA用恒定大小的量子分量扩充。我们测试了2 OIA对上述论文中提到的语言的能力。我们给出了有效的2 OIA算法来识别语言的2 QCFA机器已被证明存在，以及语言的地位相对于2 QCFA已被提出作为开放的问题。最后，我们证明了一种语言的存在，不能识别的2 OIA，但可以识别的$O(n^3)$空间图灵机。
英文摘要：
We propose a computing model, the Two-Way Optical Interference Automata (2OIA), that makes use of the phenomenon of optical interference. We introduce this model to investigate the increase in power, in terms of language recognition, of a classical Deterministic Finite Automaton (DFA) when endowed with the facility of optical interference. The question is in the spirit of Two-Way Finite Automata With Quantum and Classical States (2QCFA) [A. Ambainis and J. Watrous, Two-way Finite Automata With Quantum and Classical States, Theoretical Computer Science, 287 (1), 299-311, (2002)] wherein the classical DFA is augmented with a quantum component of constant size. We test the power of 2OIA against the languages mentioned in the above paper. We give efficient 2OIA algorithms to recognize languages for which 2QCFA machines have been shown to exist, as well as languages whose status vis-a-vis 2QCFA has been posed as open questions. Finally we show the existence of a language that cannot be recognized by a 2OIA but can be recognized by an $O(n^3)$ space Turing machine.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
