Quantum finite automata with control language
RAIRO-Theor. Inf. Appl., 40 2 (2006) 315-332
Published online: 2006-07-20
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):
Classically time-controlled quantum automata: definition and properties
Alejandro Díaz-Caro and Marcos VillagraThe Computer Journal 68 (1) 23 (2025)
https://doi.org/10.1093/comjnl/bxae089
Latvian Quantum Finite State Automata for Unary Languages
Carlo Mereghetti, Beatrice Palano and Priscilla RaucciInternational Journal of Foundations of Computer Science 36 (03) 419 (2025)
https://doi.org/10.1142/S0129054124430032
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
Guest Column
Carlo Mereghetti and Beatrice PalanoACM SIGACT News 52 (3) 38 (2021)
https://doi.org/10.1145/3494656.3494666
Photonic realization of a quantum finite automaton
Carlo Mereghetti, Beatrice Palano, Simone Cialdi, et al.Physical Review Research 2 (1) (2020)
https://doi.org/10.1103/PhysRevResearch.2.013089
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
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
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
Power of the interactive proof systems with verifiers modeled by semi-quantum two-way finite automata
Shenggen Zheng, Daowen Qiu and Jozef GruskaInformation and Computation 241 197 (2015)
https://doi.org/10.1016/j.ic.2015.02.003
On the Power of One-Way Automata with Quantum and Classical States
Maria Paola Bianchi, Carlo Mereghetti and Beatrice PalanoInternational Journal of Foundations of Computer Science 26 (07) 895 (2015)
https://doi.org/10.1142/S0129054115400055
Exponentially more concise quantum recognition of non-RMM regular languages
Daowen Qiu, Lvzhou Li, Paulo Mateus and Amilcar SernadasJournal of Computer and System Sciences 81 (2) 359 (2015)
https://doi.org/10.1016/j.jcss.2014.06.008
Size lower bounds for quantum automata
Maria Paola Bianchi, Carlo Mereghetti and Beatrice PalanoTheoretical Computer Science 551 102 (2014)
https://doi.org/10.1016/j.tcs.2014.07.004
Implementation and Application of Automata
Maria Paola Bianchi, Carlo Mereghetti and Beatrice PalanoLecture Notes in Computer Science, Implementation and Application of Automata 8587 84 (2014)
https://doi.org/10.1007/978-3-319-08846-4_6
Computing with New Resources
Maria Paola Bianchi, Carlo Mereghetti and Beatrice PalanoLecture Notes in Computer Science, Computing with New Resources 8808 161 (2014)
https://doi.org/10.1007/978-3-319-13350-8_12
Unconventional Computation and Natural Computation
Maria Paola Bianchi, Carlo Mereghetti and Beatrice PalanoLecture Notes in Computer Science, Unconventional Computation and Natural Computation 7956 19 (2013)
https://doi.org/10.1007/978-3-642-39074-6_4
State succinctness of two-way finite automata with quantum and classical states
Shenggen Zheng, Daowen Qiu, Jozef Gruska, Lvzhou Li and Paulo MateusTheoretical Computer Science 499 98 (2013)
https://doi.org/10.1016/j.tcs.2013.06.005
Characterizations of one-way general quantum finite automata
Lvzhou Li, Daowen Qiu, Xiangfu Zou, et al.Theoretical Computer Science 419 73 (2012)
https://doi.org/10.1016/j.tcs.2011.10.021
Languages Alive
Shenggen Zheng, Daowen Qiu, Lvzhou Li and Jozef GruskaLecture Notes in Computer Science, Languages Alive 7300 273 (2012)
https://doi.org/10.1007/978-3-642-31644-9_19
Descriptional Complexity of Formal Systems
Andreas Malcher, Katja Meckel, Carlo Mereghetti and Beatrice PalanoLecture Notes in Computer Science, Descriptional Complexity of Formal Systems 7386 209 (2012)
https://doi.org/10.1007/978-3-642-31623-4_16
Handbook of Finite State Based Models and Applications
Daowen Qiu, Lvzhou Li, Paulo Mateus and Jozef GruskaDiscrete Mathematics and Its Applications, Handbook of Finite State Based Models and Applications 20121086 113 (2012)
https://doi.org/10.1201/b13055-7
Algebraic Informatics
Jozef GruskaLecture Notes in Computer Science, Algebraic Informatics 4728 87 (2007)
https://doi.org/10.1007/978-3-540-75414-5_6