Size Lower Bounds for Quantum Automata

DOI10.1007/978-3-642-39074-6_4zbMath1381.68079OpenAlexW112012283MaRDI QIDQ5300907

Carlo Mereghetti, Maria Paola Bianchi, Beatrice Palano

Publication date: 28 June 2013

Published in: Unconventional Computation and Natural Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-39074-6_4

zbMATH Keywords

descriptional complexityquantum finite automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items (1)

Complexity of Promise Problems on Classical and Quantum Automata

This page was built for publication: Size Lower Bounds for Quantum Automata