中国科学院软件研究所机构知识库
Advanced  
ISCAS OpenIR  > 软件所图书馆  > 期刊论文
Title:
State succinctness of two-way finite automata with quantum and classical states
Author: Zheng, Shenggen (1) ; Qiu, Daowen (1) ; Gruska, Jozef (3) ; Li, Lvzhou (1) ; Mateus, Paulo (2)
Corresponding Author: Qiu, D.(issqdw@mail.sysu.edu.cn)
Keyword: Computing models ; Quantum finite automata ; State complexity ; Succinctness
Source: Theoretical Computer Science
Issued Date: 2013
Volume: 499, Pages:98-112
Indexed Type: SCI ; EI
Department: (1) Department of Computer Science, Sun Yat-sen University, Guangzhou 510006, China; (2) Departamento de Matemática, Instituto Superior Técnico, Technical University of Lisbon, Av. Rovisco Pais 1049-001, Lisbon, Portugal; (3) Faculty of Informatics, Masaryk University, Brno, Czech Republic; (4) State Key Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, Beijing 100080, China
Abstract: Two-way finite automata with quantum and classical states (2QCFA) were introduced by Ambainis and Watrous in 2002. In this paper we study state succinctness of 2QCFA. For any mΕZ+ and any ∈<1/2, we show that:there is a promise problem Aeq(m) which can be solved by a 2QCFA with one-sided error ∈ in a polynomial expected running time with a constant number (that depends neither on m nor on Ε) of quantum states and O(log1/∈) classical states, whereas the sizes of the corresponding deterministic finite automata (DFA), two-way nondeterministic finite automata (2NFA) and polynomial expected running time two-way probabilistic finite automata (2PFA) are at least 2m+2, √logm, and √3(logm)/b, respectively;there exists a language Ltwin(m)={wcw|wΕ{ a,b}*,|w|=m} over the alphabet Σ={a,b,c} which can be recognized by a 2QCFA with one-sided error ∈ in an exponential expected running time with a constant number of quantum states and O(log1/∈) classical states, whereas the sizes of the corresponding DFA, 2NFA and polynomial expected running time 2PFA are at least 2m, √m, and √3m/b, respectively; where b is a constant. © 2013 Elsevier B.V.
English Abstract: Two-way finite automata with quantum and classical states (2QCFA) were introduced by Ambainis and Watrous in 2002. In this paper we study state succinctness of 2QCFA. For any mΕZ+ and any ∈<1/2, we show that:there is a promise problem Aeq(m) which can be solved by a 2QCFA with one-sided error ∈ in a polynomial expected running time with a constant number (that depends neither on m nor on Ε) of quantum states and O(log1/∈) classical states, whereas the sizes of the corresponding deterministic finite automata (DFA), two-way nondeterministic finite automata (2NFA) and polynomial expected running time two-way probabilistic finite automata (2PFA) are at least 2m+2, √logm, and √3(logm)/b, respectively;there exists a language Ltwin(m)={wcw|wΕ{ a,b}*,|w|=m} over the alphabet Σ={a,b,c} which can be recognized by a 2QCFA with one-sided error ∈ in an exponential expected running time with a constant number of quantum states and O(log1/∈) classical states, whereas the sizes of the corresponding DFA, 2NFA and polynomial expected running time 2PFA are at least 2m, √m, and √3m/b, respectively; where b is a constant. © 2013 Elsevier B.V.
Language: 英语
WOS ID: WOS:000323809200007
Citation statistics:
Content Type: 期刊论文
URI: http://ir.iscas.ac.cn/handle/311060/16918
Appears in Collections:软件所图书馆_期刊论文

Files in This Item:

There are no files associated with this item.


Recommended Citation:
Zheng, Shenggen ,Qiu, Daowen ,Gruska, Jozef ,et al. State succinctness of two-way finite automata with quantum and classical states[J]. Theoretical Computer Science,2013-01-01,499:98-112.
Service
Recommend this item
Sava as my favorate item
Show this item's statistics
Export Endnote File
Google Scholar
Similar articles in Google Scholar
[Zheng, Shenggen (1)]'s Articles
[Qiu, Daowen (1)]'s Articles
[Gruska, Jozef (3)]'s Articles
CSDL cross search
Similar articles in CSDL Cross Search
[Zheng, Shenggen (1)]‘s Articles
[Qiu, Daowen (1)]‘s Articles
[Gruska, Jozef (3)]‘s Articles
Related Copyright Policies
Null
Social Bookmarking
Add to CiteULike Add to Connotea Add to Del.icio.us Add to Digg Add to Reddit
所有评论 (0)
暂无评论
 
评注功能仅针对注册用户开放,请您登录
您对该条目有什么异议,请填写以下表单,管理员会尽快联系您。
内 容:
Email:  *
单位:
验证码:   刷新
您在IR的使用过程中有什么好的想法或者建议可以反馈给我们。
标 题:
 *
内 容:
Email:  *
验证码:   刷新

Items in IR are protected by copyright, with all rights reserved, unless otherwise indicated.

 

 

Valid XHTML 1.0!
Copyright © 2007-2019  中国科学院软件研究所 - Feedback
Powered by CSpace