arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1507.01346quant-ph
收藏

双向有限自动机的时空折衷

Time-space tradeoffs for two-way finite automata

Shenggen Zheng, Daowen Qiu, Jozef Gruska

摘要:

本文研究了语言识别中{ \em时空权衡}在{ \em双向有限自动机}上的界。我们证明:(1)在{ \em双向概率有限自动机}(2 PFA)上识别语言$L_{EQ}(n)$的时空折衷上界:$TS={\bf O}(n\log n)$,而{ \em双向确定性有限自动机}的时空折衷下界是${\bf Ω}(n^2)$,(2)在{ \em}上识别语言$L_{INT}(n)$的时空折衷上界;具有量子和经典状态的有限自动机}(2 QCFA):$TS={\bf O}(n^{3/2}\log n)$,而2 PFA上的下限是$TS={\bf Ω}(n^2)$,(3)在精确2 QCFA上识别语言$L_{NE}(n)$的时空折衷上限:$TS={\bf O}(n^{1.87} \log n)$,而2 PFA上的下限是$TS={\bf Ω}(n^2)$。已经证明(Klauck,STOC'00):精确单向量子有限自动机在识别语言方面与经典有限自动机相比没有优势。然而,结果(3)表明,精确2 QCFA与经典计算相比确实具有优势,这是第一个表明精确量子计算与经典计算相比在时空折衷方面具有优势的例子。通常,在所使用的{ \em通信复杂度}模型中,通信的两方,Alice和Bob,被认为可以访问任意的计算能力。相反,我们将考虑通信的复杂性,在这样一个设置,双方都只使用有限自动机,我们证明在这种设置,量子自动机优于经典自动机和概率自动机优于确定性自动机的一些众所周知的任务。

英文摘要:

We explore bounds of {\em time-space tradeoffs} in language recognition on {\em two-way finite automata} for some special languages. We prove: (1) a time-space tradeoff upper bound for recognition of the languages $L_{EQ}(n)$ on {\em two-way probabilistic finite automata} (2PFA): $TS={\bf O}(n\log n)$, whereas a time-space tradeoff lower bound on {\em two-way deterministic finite automata} is ${\bf Ω}(n^2)$, (2) a time-space tradeoff upper bound for recognition of the languages $L_{INT}(n)$ on {\em two-way finite automata with quantum and classical states} (2QCFA): $TS={\bf O}(n^{3/2}\log n)$, whereas a lower bound on 2PFA is $TS={\bf Ω}(n^2)$, (3) a time-space tradeoff upper bound for recognition of the languages $L_{NE}(n)$ on exact 2QCFA: $TS={\bf O}(n^{1.87} \log n)$, whereas a lower bound on 2PFA is $TS={\bf Ω}(n^2)$. It has been proved (Klauck, STOC'00) that the exact one-way quantum finite automata have no advantage comparing to classical finite automata in recognizing languages. However, the result (3) shows that the exact 2QCFA do have an advantage in comparison with their classical counterparts, which has been the first example showing that the exact quantum computing have advantage in time-space tradeoff comparing to classical computing. Usually, two communicating parties, Alice and Bob, are supposed to have an access to arbitrary computational power in {\em communication complexity} model that is used. Instead of that we will consider communication complexity in such a setting that two parties are using only finite automata and we prove in this setting that quantum automata are better than classical automata and also probabilistic automata are better than deterministic automata for some well known tasks.

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

↑