Publication:2762497
From MaRDI portal
zbMath0976.68087arXivquant-ph/0009004MaRDI QIDQ2762497
Andris Ambainis, Arnolds Ķikusts, Māris Valdats
Publication date: 9 January 2002
Full work available at URL: https://arxiv.org/abs/quant-ph/0009004
68Q45: Formal languages and automata
Related Items
On the Size of One-way Quantum Finite Automata with Periodic Behaviors, Quantum State Complexity of Formal Languages, Improved Constructions of Quantum Automata, Another approach to the equivalence of measure-many one-way quantum finite automata and its application, One-way reversible and quantum finite automata with advice, Improved constructions of quantum automata, Efficient probability amplification in two-way quantum finite automata, On a class of languages recognizable by probabilistic reversible decide-and-halt automata, Exact results for accepting probabilities of quantum automata., Quantum versus deterministic counter automata, Hierarchy and equivalence of multi-letter quantum finite automata, Some formal tools for analyzing quantum automata., Interactive proofs with quantum finite automata, Quantum Automata Theory – A Review, Quantum finite automata with control language, Lower Bounds for Generalized Quantum Finite Automata