scientific article; zbMATH DE number 1688355

MaRDI QIDQ2762497zbMATH OpenFDO

Authors Arnolds Ķikusts, Māris Valdats, Andris Ambainis

Publication date 9 January 2002

Full work available at URL https://arxiv.org/abs/quant-ph/0009004, http://link.springer.de/link/service/series/0558/bibs/2010/20100075

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Implementation and Application of Automata
• Languages recognized by nondeterministic quantum finite automata
• Multi-letter Reversible and Quantum Finite Automata
• Characterizations of one-way general quantum finite automata
• Characterizations of 1-Way Quantum Finite Automata

Cited in

(32)

• 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
• On language varieties without Boolean operations
• Hierarchy and equivalence of multi-letter quantum finite automata
• Some formal tools for analyzing quantum automata.
• Interactive proofs with quantum finite automata
• Determining the equivalence for one-way quantum finite automata
• Quantum automata theory -- a review
• Languages recognized by nondeterministic quantum finite automata
• Languages Recognized with Unbounded Error by Quantum Finite Automata
• Quantum finite automata with control language
• scientific article; zbMATH DE number 6533717 (Why is no real title available?)
• Lower Bounds for Generalized Quantum Finite Automata
• scientific article; zbMATH DE number 35744 (Why is no real title available?)
• Another approach to the equivalence of measure-many one-way quantum finite automata and its application
• Exponentially more concise quantum recognition of non-RMM regular languages
• On the Size of One-way Quantum Finite Automata with Periodic Behaviors
• scientific article; zbMATH DE number 1405684 (Why is no real title available?)
• One-way topological automata and the tantalizing effects of their topological features
• Quantum finite automata and linear context-free languages: a decidable problem
• STACS 2004
• Decidable and Undecidable Problems about Quantum Automata
• Multi-letter Reversible and Quantum Finite Automata
• Quantum state complexity of formal languages
• Improved Constructions of Quantum Automata
• Implementation and Application of Automata
• Deterministic construction of QFAs based on the quantum fingerprinting technique
• Eilenberg's variety theorem without Boolean operations
• Characterizations of one-way general quantum finite automata

This page was built for publication:

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