Quantum finite automata with control language

DOI10.1051/ita:2006007zbMath1112.68064OpenAlexW2078012851MaRDI QIDQ3431442

Beatrice Palano, Carlo Mereghetti

Publication date: 10 April 2007

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: http://www.numdam.org/item?id=ITA_2006__40_2_315_0

zbMATH Keywords

quantum computingquantum finite automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum computation (81P68)

Related Items (max. 100)

Lower bounds on the size of semi-quantum finite automata ⋮ One-Way Finite Automata with Quantum and Classical States ⋮ Complexity of Promise Problems on Classical and Quantum Automata ⋮ State succinctness of two-way finite automata with quantum and classical states ⋮ Size lower bounds for quantum automata ⋮ On the Power of One-Way Automata with Quantum and Classical States ⋮ Algebraic Methods in Quantum Informatics ⋮ Exponentially more concise quantum recognition of non-RMM regular languages ⋮ Quantum finite automata: advances on Bertoni's ideas ⋮ Characterizations of one-way general quantum finite automata ⋮ On coverings of products of uninitialized sequential quantum machines ⋮ Power of the interactive proof systems with verifiers modeled by semi-quantum two-way finite automata ⋮ On hybrid models of quantum finite automata

Cites Work

• Quantum automata and quantum grammars
• Regular languages accepted by quantum automata
• Algebraic results on quantum automata
• Small size quantum automata recognizing some regular languages
• Some formal tools for analyzing quantum automata.
• Note on the Succinctness of Deterministic, Nondeterministic, Probabilistic and Quantum Finite Automata
• Characterizations of 1-Way Quantum Finite Automata
• On the Size of One-way Quantum Finite Automata with Periodic Behaviors
• GOLOMB RULERS AND DIFFERENCE SETS FOR SUCCINCT QUANTUM AUTOMATA
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Quantum finite automata with control language