On the state complexity of semi-quantum finite automata
RAIRO-Theor. Inf. Appl., 48 2 (2014) 187-207
Published online: 2014-04-17
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:
This article has been cited by the following article(s):
Unary Quantum Finite State Automata with Control Language
Carlo Mereghetti, Beatrice Palano and Priscilla RaucciApplied Sciences 14 (4) 1490 (2024)
https://doi.org/10.3390/app14041490
Decompositions of average probability uninitialized sequential quantum machines
Feidan HuangSoft Computing 26 (13) 5965 (2022)
https://doi.org/10.1007/s00500-022-07063-2
Nonuniform families of polynomial-size quantum finite automata and quantum logarithmic-space computation with polynomial-size advice
Tomoyuki YamakamiInformation and Computation 286 104783 (2022)
https://doi.org/10.1016/j.ic.2021.104783
62 (2021)
https://doi.org/10.1109/CTISC52352.2021.00019
A Quantum Finite Automata Approach to Modeling the Chemical Reactions
Amandeep Singh Bhatia and Shenggen ZhengFrontiers in Physics 8 (2020)
https://doi.org/10.3389/fphy.2020.547370
On Coverings of Products of Uninitialized Sequential Quantum Machines
Feidan HuangInternational Journal of Theoretical Physics 58 (5) 1418 (2019)
https://doi.org/10.1007/s10773-019-04031-9
Quantum finite automata: Advances on Bertoni's ideas
Maria Paola Bianchi, Carlo Mereghetti and Beatrice PalanoTheoretical Computer Science 664 39 (2017)
https://doi.org/10.1016/j.tcs.2016.01.045
Theory and Practice of Natural Computing
Shenggen Zheng, Daowen Qiu and Jozef GruskaLecture Notes in Computer Science, Theory and Practice of Natural Computing 10687 305 (2017)
https://doi.org/10.1007/978-3-319-71069-3_24
Generalizations of the distributed Deutsch–Jozsa promise problem
JOZEF GRUSKA, DAOWEN QIU and SHENGGEN ZHENGMathematical Structures in Computer Science 27 (3) 311 (2017)
https://doi.org/10.1017/S0960129515000158
Application of distributed semi-quantum computing model in phase estimation
Kai Li, Daowen Qiu, Lvzhou Li, Shenggen Zheng and Zhenbang RongInformation Processing Letters 120 23 (2017)
https://doi.org/10.1016/j.ipl.2016.12.002
Promise problems solved by quantum and classical finite automata
Shenggen Zheng, Lvzhou Li, Daowen Qiu and Jozef GruskaTheoretical Computer Science 666 48 (2017)
https://doi.org/10.1016/j.tcs.2016.12.025
Lower bounds on the size of semi-quantum finite automata
Lvzhou Li and Daowen QiuTheoretical Computer Science 623 75 (2016)
https://doi.org/10.1016/j.tcs.2015.09.031
Descriptional Complexity of Formal Systems
Marcos Villagra and Tomoyuki YamakamiLecture 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 FengInformation and Computation 244 229 (2015)
https://doi.org/10.1016/j.ic.2015.07.001
Potential of Quantum Finite Automata with Exact Acceptance
Jozef Gruska, Daowen Qiu and Shenggen ZhengInternational Journal of Foundations of Computer Science 26 (03) 381 (2015)
https://doi.org/10.1142/S0129054115500215
On hybrid models of quantum finite automata
Lvzhou Li and Yuan FengJournal of Computer and System Sciences 81 (7) 1144 (2015)
https://doi.org/10.1016/j.jcss.2015.01.001