中国科学院软件研究所机构知识库
Advanced  
ISCAS OpenIR  > 软件所图书馆  > 期刊论文
Title:
on the complexity of minimizing probabilistic and quantum automata
Author: Mateus Paulo ; Qiu Daowen ; Li Lvzhou
Source: Information and Computation
Issued Date: 2012
Volume: 218, Pages:36-53
Indexed Type: ei
Department: (1) SQIG, Instituto de Telecomunicações, Av. Rovisco Pais 1049-001, Lisbon, Portugal; (2) Dep. Matemática, Instituto Superior Técnico, Universidade Técnica de Lisboa, Portugal; (3) Department of Computer Science, Sun Yat-sen University, Guangzhou 510006, China; (4) State Key Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, Beijing 100080, China
English Abstract: Several types of automata, such as probabilistic and quantum automata, require to work with real and complex numbers. For such automata the acceptance of an input is quantified with a probability. There are plenty of results in the literature addressing the complexity of checking the equivalence of these automata, that is, checking whether two automata accept all inputs with the same probability. On the other hand, the critical problem of finding the minimal automata equivalent to a given one has been left open [C. Moore, J.P. Crutchfield, Quantum automata and quantum grammars, Theoret. Comput. Sci. 237 (2000) 275-306, see p. 304, Problem 5]. In this work, we reduce the minimization problem of probabilistic and quantum automata to finding a solution of a system of algebraic polynomial (in)equations. An EXPSPACE upper bound on the complexity of the minimization problem is derived by applying Renegars algorithm. More specifically, we show that the state minimization of probabilistic automata, measure-once quantum automata, measure-many quantum automata, measure-once generalized quantum automata, and measure-many generalized quantum automata is decidable and in EXPSPACE. Finally, we also solve an open problem concerning minimal covering of stochastic sequential machines [A. Paz, Introduction to Probabilistic Automata, Academic Press, New York, 1971, p. 43]. © 2012 Elsevier Inc.
Language: 英语
WOS ID: WOS:000309195100003
Citation statistics:
Content Type: 期刊论文
URI: http://ir.iscas.ac.cn/handle/311060/14728
Appears in Collections:软件所图书馆_期刊论文

Files in This Item:
File Name/ File Size Content Type Version Access License
1-s2.0-S0890540112001149-main.pdf(295KB)----限制开放 联系获取全文

Recommended Citation:
Mateus Paulo,Qiu Daowen,Li Lvzhou. on the complexity of minimizing probabilistic and quantum automata[J]. Information and Computation,2012-01-01,218:36-53.
Service
Recommend this item
Sava as my favorate item
Show this item's statistics
Export Endnote File
Google Scholar
Similar articles in Google Scholar
[Mateus Paulo]'s Articles
[Qiu Daowen]'s Articles
[Li Lvzhou]'s Articles
CSDL cross search
Similar articles in CSDL Cross Search
[Mateus Paulo]‘s Articles
[Qiu Daowen]‘s Articles
[Li Lvzhou]‘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