On the power of one-way automata with quantum and classical states

DOI10.1007/978-3-319-08846-4_6zbMATH Open1302.68150OpenAlexW84569314MaRDI QIDQ3192253FDOQ3192253

Authors Maria Paola Bianchi, Carlo Mereghetti, Beatrice Palano

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

quantum automatadescriptional complexityregular languages

Mathematics Subject Classification ID

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

Recommendations

• On the power of one-way automata with quantum and classical states
• One-way finite automata with quantum and classical states
• scientific article; zbMATH DE number 1759400
• Quantum finite automata with control language
• Exponentially more concise quantum recognition of non-RMM regular languages

Cited in

(10)

• The descriptional power of queue automata of constant length
• One-way finite automata with quantum and classical states
• Two-way finite automata with quantum and classical states.
• Some formal tools for analyzing quantum automata.
• On the power of one-way automata with quantum and classical states
• Characterizations of one-way general quantum finite automata
• On the power of two-way multihead quantum finite automata
• Quantum finite automata: advances on Bertoni's ideas
• Deterministic and nondeterministic iterated uniform finite-state transducers: computational and descriptional power
• Lower bounds on the size of semi-quantum finite automata

This page was built for publication: On the power of one-way automata with quantum and classical states

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3192253)