语言识别的广义量子有限自动机与无界错误（摘要和海报）
Language recognition by generalized quantum finite automata with unbounded error (abstract & poster)
摘要：
本文推广了arXiv：0901.2703v1的结果，证明了所有的单向量子有限自动机（QFA）模型，至少和Kondacs-Watrous的QFA一样一般，在这种情况下，它们在幂函数上等价于经典的概率有限自动机.与它们的概率对应物不同，允许磁带头在其遍历输入的过程中停留一些步骤，确实扩大了由这种具有无限误差的QFA识别的语言类。(Note定理1的抽象证明在前一个版本（arXiv：0901.2703v1）中给出。
英文摘要：
In this note, we generalize the results of arXiv:0901.2703v1 We show that all one-way quantum finite automaton (QFA) models that are at least as general as Kondacs-Watrous QFA's are equivalent in power to classical probabilistic finite automata in this setting. Unlike their probabilistic counterparts, allowing the tape head to stay put for some steps during its traversal of the input does enlarge the class of languages recognized by such QFA's with unbounded error. (Note that, the proof of Theorem 1 in the abstract was presented in the previous version (arXiv:0901.2703v1).)
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
