Articles citing this article

The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).

Cited article:

Unary Quantum Finite State Automata with Control Language

Carlo Mereghetti, Beatrice Palano and Priscilla Raucci
Applied Sciences 14 (4) 1490 (2024)
https://doi.org/10.3390/app14041490

Nonuniform families of polynomial-size quantum finite automata and quantum logarithmic-space computation with polynomial-size advice

Tomoyuki Yamakami
Information and Computation 286 104783 (2022)
https://doi.org/10.1016/j.ic.2021.104783

Application of distributed semi-quantum computing model in phase estimation

Kai Li, Daowen Qiu, Lvzhou Li, Shenggen Zheng and Zhenbang Rong
Information Processing Letters 120 23 (2017)
https://doi.org/10.1016/j.ipl.2016.12.002

Generalizations of the distributed Deutsch–Jozsa promise problem

JOZEF GRUSKA, DAOWEN QIU and SHENGGEN ZHENG
Mathematical Structures in Computer Science 27 (3) 311 (2017)
https://doi.org/10.1017/S0960129515000158

Theory and Practice of Natural Computing

Shenggen Zheng, Daowen Qiu and Jozef Gruska
Lecture Notes in Computer Science, Theory and Practice of Natural Computing 10687 305 (2017)
https://doi.org/10.1007/978-3-319-71069-3_24

Promise problems solved by quantum and classical finite automata

Shenggen Zheng, Lvzhou Li, Daowen Qiu and Jozef Gruska
Theoretical Computer Science 666 48 (2017)
https://doi.org/10.1016/j.tcs.2016.12.025

Potential of Quantum Finite Automata with Exact Acceptance

Jozef Gruska, Daowen Qiu and Shenggen Zheng
International Journal of Foundations of Computer Science 26 (03) 381 (2015)
https://doi.org/10.1142/S0129054115500215

Descriptional Complexity of Formal Systems

Marcos Villagra and Tomoyuki Yamakami
Lecture Notes in Computer Science, Descriptional Complexity of Formal Systems 9118 280 (2015)
https://doi.org/10.1007/978-3-319-19225-3_24

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

Lvzhou Li and Yuan Feng
Information and Computation 244 229 (2015)
https://doi.org/10.1016/j.ic.2015.07.001