Multi-letter Reversible and Quantum Finite Automata

DOI10.1007/978-3-540-73208-2_9MaRDI QIDQ5428220zbMATH OpenOpenAlexFDO

Authors Aleksandrs Belovs, Ansis Rosmanis, J. Smotrovs

Publication date 28 November 2007

Published in Developments in Language Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-73208-2_9

Mathematics Subject Classification ID

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

Recommendations

• On the class of languages recognizable by 1-way quantum finite automata
• Quantum finite multitape automata
• Implementation and Application of Automata
• Quantum finite automata and probabilistic reversible automata: \(\mathcal{R}\)-trivial idempotent languages
• Hierarchy and equivalence of multi-letter quantum finite automata

Cited in

(9)

• Hierarchy and equivalence of multi-letter quantum finite automata
• On the class of languages recognizable by 1-way quantum finite automata
• Quantum finite automata and probabilistic reversible automata: \(\mathcal{R}\)-trivial idempotent languages
• Exponentially more concise quantum recognition of non-RMM regular languages
• Quantum lower bounds for approximate counting via Laurent polynomials
• On the power of two-way multihead quantum finite automata
• Mirrors and memory in quantum automata
• State complexity of one-way quantum finite automata together with classical states
• Multi-letter quantum finite automata: decidability of the equivalence and minimization of states

This page was built for publication: Multi-letter Reversible and Quantum Finite Automata

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