revisiting the power and equivalence of one-way quantum finite automata
文献类型：会议论文
| 作者 | Li Lvzhou ; Qiu Daowen |
| 出版日期 | 2010 |
| 会议名称 | 6th International Conference on Intelligent Computing, ICIC 2010 |
| 会议日期 | August 18, |
| 会议地点 | Changsha, China |
| 关键词 | Automata theory Equivalence classes Formal languages Linguistics Quantum computers |
| 页码 | 40551 |
| 英文摘要 | We give a new proof for the fact that measure-many one-way quantum finite automata (MM-1QFA) recognize only regular languages with bounded error. Our proof, different from the one in the literature, gives another insight to the recognition power of MM-1QFA. Moreover, we generalize the proof to a broader class of automata that include probabilistic automata and some kinds of quantum finite automata. In addition, we briefly discuss the equivalence problem of some quantum computing models in a uniform framework. © 2010 Springer-Verlag Berlin Heidelberg. |
| 收录类别 | EI |
| 会议主办者 | IEEE Computational Intelligence Society; International Neural Network Society; National Science Foundation of China |
| 会议录 | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
 |
| 会议录出版地 | Germany |
| 语种 | 英语 |
| ISSN号 | 3029743 |
| ISBN号 | 3642149316 |
| 源URL | [http://124.16.136.157/handle/311060/8892]  |
| 专题 | 软件研究所_软件所图书馆_2010软件所会议论文 |
| 推荐引用方式 GB/T 7714 | Li Lvzhou,Qiu Daowen. revisiting the power and equivalence of one-way quantum finite automata[C]. 见:6th International Conference on Intelligent Computing, ICIC 2010. Changsha, China. August 18,. |
入库方式： OAI收割
来源：软件研究所
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。