arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0812.0852cs.CC
收藏

多字母量子有限自动机的层次与等价

Hierarchy and equivalence of multi-letter quantum finite automata

Daowen Qiu, Sheng Yu

摘要:

多字母{ \it量子有限自动机}(QFA)是Belovs,Rosmanis和Smotrovs最近提出的一种新的单向QFA模型(LNCS,Vol.4588,Springer,Berlin,2007,pp. 60-71),他们表明,多字母QFA可以接受没有错误的一些常规语言($(a+b)^{*}b$)是不可接受的单向QFA。在本文中,我们继续研究多字母QFA。我们主要研究了两个问题:(1)证明了$(k+1)$ -letter QFA比$k$ -letter QFA在计算上更强大,即$(k+1)$ -letter QFA可以接受一些任何$k$ -letter QFA都不能接受的正则语言.通过实例与单向QFA进行了比较;(2)证明了一个$k_{1}$ -字母QFA ${\cal A}_1$和另一个$k_{2}$ -字母QFA ${\cal A}_2$等价当且仅当它们是$(n_{1}+n_{2})^{4}+k-1$ -等价的,并且用这种方法确定两个多字母QFA等价的时间复杂度是$O(n^{12}+k^{2}n^{4}+kn^{8})$,其中$n_{1}$和$n_{2}$是${\cal A}_{1}$和${\cal A}_{2}$的状态数,和$k=\max(k_{1},k_{2})$。还讨论了其他一些问题,供进一步审议。

英文摘要:

Multi-letter {\it quantum finite automata} (QFAs) were a new one-way QFA model proposed recently by Belovs, Rosmanis, and Smotrovs (LNCS, Vol. 4588, Springer, Berlin, 2007, pp. 60-71), and they showed that multi-letter QFAs can accept with no error some regular languages ($(a+b)^{*}b$) that are unacceptable by the one-way QFAs. In this paper, we continue to study multi-letter QFAs. We mainly focus on two issues: (1) we show that $(k+1)$-letter QFAs are computationally more powerful than $k$-letter QFAs, that is, $(k+1)$-letter QFAs can accept some regular languages that are unacceptable by any $k$-letter QFA. A comparison with the one-way QFAs is made by some examples; (2) we prove that a $k_{1}$-letter QFA ${\cal A}_1$ and another $k_{2}$-letter QFA ${\cal A}_2$ are equivalent if and only if they are $(n_{1}+n_{2})^{4}+k-1$-equivalent, and the time complexity of determining the equivalence of two multi-letter QFAs using this method is $O(n^{12}+k^{2}n^{4}+kn^{8})$, where $n_{1}$ and $n_{2}$ are the numbers of states of ${\cal A}_{1}$ and ${\cal A}_{2}$, respectively, and $k=\max(k_{1},k_{2})$. Some other issues are addressed for further consideration.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑