中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
首页
机构
成果
学者
登录
注册
登陆
×
验证码:
换一张
忘记密码?
记住我
×
校外用户登录
CAS IR Grid
机构
软件研究所 [8]
采集方式
OAI收割 [8]
内容类型
期刊论文 [7]
会议论文 [1]
发表日期
2013 [1]
2012 [3]
2011 [2]
2010 [2]
学科主题
Computer S... [2]
筛选
浏览/检索结果:
共8条,第1-8条
帮助
条数/页:
5
10
15
20
25
30
35
40
45
50
55
60
65
70
75
80
85
90
95
100
排序方式:
请选择
题名升序
题名降序
提交时间升序
提交时间降序
作者升序
作者降序
发表日期升序
发表日期降序
State succinctness of two-way finite automata with quantum and classical states
期刊论文
OAI收割
Theoretical Computer Science, 2013, 卷号: 499, 页码: 98-112
Zheng, Shenggen (1)
;
Qiu, Daowen (1)
;
Gruska, Jozef (3)
;
Li, Lvzhou (1)
;
Mateus, Paulo (2)
  |  
收藏
  |  
浏览/下载:19/0
  |  
提交时间:2014/12/16
Computing models
Quantum finite automata
State complexity
Succinctness
automata theory based on complete residuated lattice-valued logic: turing machines
期刊论文
OAI收割
Fuzzy Sets and Systems, 2012, 卷号: 208, 页码: 43-66
Wu Lihua
;
Qiu Daowen
;
Xing Hongyan
  |  
收藏
  |  
浏览/下载:18/0
  |  
提交时间:2012/11/12
on the complexity of minimizing probabilistic and quantum automata
期刊论文
OAI收割
Information and Computation, 2012, 卷号: 218, 页码: 36-53
Mateus Paulo
;
Qiu Daowen
;
Li Lvzhou
  |  
收藏
  |  
浏览/下载:19/0
  |  
提交时间:2012/11/12
one-way finite automata with quantum and classical states
期刊论文
OAI收割
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2012, 卷号: 7300 LNAI, 页码: 273-290
Zheng Shenggen
;
Qiu Daowen
;
Li Lvzhou
;
Gruska Jozef
  |  
收藏
  |  
浏览/下载:22/0
  |  
提交时间:2013/09/17
Automata theory
Computer simulation
multi-letter quantum finite automata: decidability of the equivalence and minimization of states
期刊论文
OAI收割
ACTA INFORMATICA, 2011, 卷号: 48, 期号: 5-6, 页码: 271-290
Qiu Daowen
;
Li Lvzhou
;
Zou Xiangfu
;
Mateus Paulo
;
Gruska Jozef
  |  
收藏
  |  
浏览/下载:10/0
  |  
提交时间:2013/10/08
characterizations of one-way general quantum finite automata
期刊论文
OAI收割
Theoretical Computer Science, 2011, 卷号: 419, 页码: -
Lvzhou Li
;
Daowen Qiu
;
Xiangfu Zou
;
Lvjun Li
;
Lihua Wu
;
Paulo Mateus
  |  
收藏
  |  
浏览/下载:17/0
  |  
提交时间:2013/10/08
Formal languages
Quantum finite automata
Regular languages
Equivalence
investigating the implementation of restricted sets of multiqubit operations on distant qubits: a communication complexity perspective
期刊论文
OAI收割
Quantum Information Processing, 2010, 页码: 40553
Situ Haozhen
;
Qiu Daowen
  |  
收藏
  |  
浏览/下载:8/0
  |  
提交时间:2011/05/23
Communication
revisiting the power and equivalence of one-way quantum finite automata
会议论文
OAI收割
6th International Conference on Intelligent Computing, ICIC 2010, Changsha, China, August 18,
Li Lvzhou
;
Qiu Daowen
  |  
收藏
  |  
浏览/下载:16/0
  |  
提交时间:2011/03/31
Automata theory
Equivalence classes
Formal languages
Linguistics
Quantum computers