Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Li, Lvzhou"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Characterizations of one-way general quantum finite automata
Lvzhou Li
,
Daowen Qiu
,
Xiangfu Zou
,
Lvjun Li
,
Lihua Wu
,
Paulo Mateus
Theoretical Computer Science
419
, 2012, pp. 73-91
On the complexity of minimizing probabilistic and quantum automata
Paulo Mateus
,
Daowen Qiu
,
Lvzhou Li
Information and Computation
218
, 2012, pp. 36-53
Some languages recognized by two-way finite automata with quantum and classical states
Shenggen Zheng
,
Daowen Qiu
,
Lvzhou Li
International Journal of Foundations of Computer Science
23
(5), 2012, pp. 1117-1129
Multi-letter quantum finite automata: Decidability of the equivalence and minimization of states
Daowen Qiu
,
Lvzhou Li
,
Xiangfu Zou
,
Paulo Mateus
,
Jozef Gruska
Acta Informatica
48
(5-6), 2011, pp. 271-290
A note on quantum sequential machines
Lvzhou Li
,
Daowen Qiu
Theoretical Computer Science
410
(26), 2009, pp. 2529-2535
Determining the equivalence for one-way quantum finite automata
Lvzhou Li
,
Daowen Qiu
Theoretical Computer Science
403
(1), 2008, pp. 42-51
Determination of equivalence between quantum sequential machines
Lvzhou Li
,
Daowen Qiu
Theoretical Computer Science
358
(1), 2006, pp. 65-74
State succinctness of two-way finite automata with quantum and classical states
Shenggen Zheng
,
Daowen Qiu
,
Jozef Gruska
,
Lvzhou Li
,
Paulo Mateus
Theoretical Computer Science
499
, pp. 98-112