On the Power of One-Way Automata with Quantum and Classical States

DOI10.1007/978-3-319-08846-4_6zbMath1302.68150OpenAlexW84569314MaRDI QIDQ3192253

Carlo Mereghetti, Beatrice Palano, Maria Paola Bianchi

Publication date: 26 September 2014

Published in: Implementation and Application of Automata (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-08846-4_6

zbMATH Keywords

regular languagesquantum automatadescriptional complexity

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Quantum computation (81P68)

Related Items (4)

Lower bounds on the size of semi-quantum finite automata ⋮ Quantum finite automata: advances on Bertoni's ideas ⋮ The descriptional power of queue automata of constant length ⋮ Deterministic and nondeterministic iterated uniform finite-state transducers: computational and descriptional power

This page was built for publication: On the Power of One-Way Automata with Quantum and Classical States