Multi-letter Reversible and Quantum Finite Automata

DOI10.1007/978-3-540-73208-2_9zbMath1179.68066OpenAlexW1540981970MaRDI QIDQ5428220

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)

Related Items (6)

Mirrors and memory in quantum automata ⋮ Exponentially more concise quantum recognition of non-RMM regular languages ⋮ Hierarchy and equivalence of multi-letter quantum finite automata ⋮ Unnamed Item ⋮ On the power of two-way multihead quantum finite automata ⋮ 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