Lvzhou Li

According to our database1, Lvzhou Li
  • authored at least 28 papers between 2006 and 2017.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2017
Promise problems solved by quantum and classical finite automata.
Theor. Comput. Sci., 2017

Application of distributed semi-quantum computing model in phase estimation.
Inf. Process. Lett., 2017

Image Encryption Algorithms Based on Non-uniform Second-Order Reversible Cellular Automata with Balanced Rules.
Proceedings of the Intelligent Computing Theories and Application, 2017

2016
Lower bounds on the size of semi-quantum finite automata.
Theor. Comput. Sci., 2016

2015
On the State Minimization of Fuzzy Automata.
IEEE Trans. Fuzzy Systems, 2015

Exponentially more concise quantum recognition of non-RMM regular languages.
J. Comput. Syst. Sci., 2015

On hybrid models of quantum finite automata.
J. Comput. Syst. Sci., 2015

Quantum Markov chains: Description of hybrid systems, decidability of equivalence, and model checking linear-time properties.
Inf. Comput., 2015

Lower bounds on the size of semi-quantum automata.
CoRR, 2015

Quantum Markov chains: description of hybrid systems, decidability of equivalence, and model checking linear-time properties.
CoRR, 2015

2014
Recognizability versus solvability of promise problems in finite, classical and quantum automata, framework.
CoRR, 2014

2013
State succinctness of two-way finite automata with quantum and classical states.
Theor. Comput. Sci., 2013

Decidability of minimization of fuzzy automata
CoRR, 2013

2012
Quantum Finite Automata.
Proceedings of the Handbook of Finite State Based Models and Applications., 2012

Characterizations of one-way general quantum finite automata.
Theor. Comput. Sci., 2012

Some Languages Recognized by Two-Way Finite Automata with Quantum and Classical States.
Int. J. Found. Comput. Sci., 2012

On the complexity of minimizing probabilistic and quantum automata.
Inf. Comput., 2012

On hybrid models of quantum finite automata
CoRR, 2012

State succinctness of two-way finite automata with quantum and classical states
CoRR, 2012

One-Way Finite Automata with Quantum and Classical States.
Proceedings of the Languages Alive, 2012

2011
Multi-letter quantum finite automata: decidability of the equivalence and minimization of states.
Acta Inf., 2011

Quantum Information Splitting Using GHZ-Type and W-Type States.
Proceedings of the Bio-Inspired Computing and Applications, 2011

2010
Revisiting the Power and Equivalence of One-Way Quantum Finite Automata.
Proceedings of the Advanced Intelligent Computing Theories and Applications. With Aspects of Artificial Intelligence, 2010

2009
A note on quantum sequential machines.
Theor. Comput. Sci., 2009

On mathematical theory of the duality computers.
Quantum Information Processing, 2009

2008
Determining the equivalence for one-way quantum finite automata.
Theor. Comput. Sci., 2008

An overview of quantum computation models: quantum automata.
Frontiers of Computer Science in China, 2008

2006
Determination of equivalence between quantum sequential machines.
Theor. Comput. Sci., 2006


  Loading...