arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1203.0113cs.CCcs.FLmath.NT
收藏

关于多字母与多字母多次测量量子自动机的等价性、语言等价性及最小化

On equivalence, languages equivalence and minimization of multi-letter and multi-letter measure-many quantum automata

Tianrong Lin

AI总结:

该研究推导了多字母量子有限自动机与多字母多次测量量子有限自动机的等价性判定条件,证明两类自动机的切点语言等价性均不可判定,并评述了单向量子有限自动机最小化的开放问题。

摘要:

我们首先证明:给定同一输入字母表Σ上的一个$k_1$字母量子有限自动机$\u27e8mathcal{A}_1$和一个$k_2$字母量子有限自动机$\u27e8mathcal{A}_2$,二者等价当且仅当它们是$(n_1^2+n_2^2-1)|Σ|^{k-1}+k$-等价的,其中$n_i$($i=1,2$)分别是$\u27e8mathcal{A}_i$的状态数,$k=\u27e8max\{k_1,k_2\}$。通过应用笔者提出的、用于处理“多次测量单向量子有限自动机(measure many one-way quantum finite automata)”等价性问题的方法,我们还证明:一个$k_1$字母多次测量量子有限自动机$\u27e8mathcal{A}_1$和一个$k_2$字母多次测量量子有限自动机$\u27e8mathcal{A}_2$等价当且仅当它们是$(n_1^2+n_2^2-1)|Σ|^{k-1}+k$-等价的,其中$n_i$($i=1,2$)分别是$\u27e8mathcal{A}_i$的状态数,$k=\u27e8max\{k_1,k_2\}$。\n 接下来,我们研究了这两类量子有限自动机的语言等价性问题。我们证明:对于$k$字母量子有限自动机,非严格切点语言等价性问题是不可判定的,即无法判定$L_{\geqλ}(\u27e8mathcal{A}_1)=L_{\geqλ}(\u27e8mathcal{A}_2)$是否成立,其中$0<λ\leq 1$且$\u27e8mathcal{A}_i$为$k_i$字母量子有限自动机。进一步地,我们证明$k$字母多次测量量子有限自动机的严格与非严格切点语言等价性问题均不可判定。本文还总结了上述结果的直接推论。\n 最后,我们对现有关于单向量子有限自动机最小化问题的证明进行了评述,这不仅是因为我们对这类在经典自动机理论中十分重要的问题抱有浓厚兴趣,还因为笔者认为该问题本身就是一项挑战。这一问题目前仍为开放问题。

英文摘要:

We first show that given a $k_1$-letter quantum finite automata $\mathcal{A}_1$ and a $k_2$-letter quantum finite automata $\mathcal{A}_2$ over the same input alphabet $Σ$, they are equivalent if and only if they are $(n_1^2+n_2^2-1)|Σ|^{k-1}+k$-equivalent where $n_1$, $i=1,2$, are the numbers of state in $\mathcal{A}_i$ respectively, and $k=\max\{k_1,k_2\}$. By applying a method, due to the author, used to deal with the equivalence problem of {\it measure many one-way quantum finite automata}, we also show that a $k_1$-letter measure many quantum finite automaton $\mathcal{A}_1$ and a $k_2$-letter measure many quantum finite automaton $\mathcal{A}_2$ are equivalent if and only if they are $(n_1^2+n_2^2-1)|Σ|^{k-1}+k$-equivalent where $n_i$, $i=1,2$, are the numbers of state in $\mathcal{A}_i$ respectively, and $k=\max\{k_1,k_2\}$. Next, we study the language equivalence problem of those two kinds of quantum finite automata. We show that for $k$-letter quantum finite automata, the non-strict cut-point language equivalence problem is undecidable, i.e., it is undecidable whether $L_{\geqλ}(\mathcal{A}_1)=L_{\geqλ}(\mathcal{A}_2)$ where $0<λ\leq 1$ and $\mathcal{A}_i$ are $k_i$-letter quantum finite automata. Further, we show that both strict and non-strict cut-point language equivalence problem for $k$-letter measure many quantum finite automata are undecidable. The direct consequences of the above outcomes are summarized in the paper. Finally, we comment on existing proofs about the minimization problem of one way quantum finite automata not only because we have been showing great interest in this kind of problem, which is very important in classical automata theory, but also due to that the problem itself, personally, is a challenge. This problem actually remains open.

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

↑