Pages that link to "Item:Q2432533"

The following pages link to Algebraic results on quantum automata (Q2432533):

Displaying 29 items.

• State succinctness of two-way finite automata with quantum and classical states (Q391188) (← links)
• Size lower bounds for quantum automata (Q403023) (← links)
• Another approach to the equivalence of measure-many one-way quantum finite automata and its application (Q439940) (← links)
• Exponentially more concise quantum recognition of non-RMM regular languages (Q473186) (← links)
• Quantum finite automata: advances on Bertoni's ideas (Q517033) (← links)
• Two-tape finite automata with quantum and classical states (Q539559) (← links)
• Unbounded-error quantum computation with small space bounds (Q550246) (← links)
• Characterizations of one-way general quantum finite automata (Q764358) (← links)
• On relation between linear temporal logic and quantum finite automata (Q783667) (← links)
• Improved constructions of mixed state quantum automata (Q1017405) (← links)
• Unary probabilistic and quantum automata on promise problems (Q1617185) (← links)
• Power of the interactive proof systems with verifiers modeled by semi-quantum two-way finite automata (Q2343133) (← links)
• Determining the equivalence for one-way quantum finite automata (Q2518375) (← links)
• Complexity of Promise Problems on Classical and Quantum Automata (Q2944886) (← links)
• Quantum Finite Automata: A Modern Introduction (Q2944891) (← links)
• Quantum Automata Theory – A Review (Q3098037) (← links)
• One-Way Finite Automata with Quantum and Classical States (Q3166958) (← links)
• Languages Recognized with Unbounded Error by Quantum Finite Automata (Q3392970) (← links)
• Quantum finite automata with control language (Q3431442) (← links)
• Lower Bounds for Generalized Quantum Finite Automata (Q3540128) (← links)
• SOME LANGUAGES RECOGNIZED BY TWO-WAY FINITE AUTOMATA WITH QUANTUM AND CLASSICAL STATES (Q4902896) (← links)
• (Q4988166) (← links)
• On the Computational Power of Affine Automata (Q5739014) (← links)
• On the Power of One-Way Automata with Quantum and Classical States (Q5744127) (← links)
• How does adiabatic quantum computation fit into quantum automata theory? (Q5918616) (← links)
• Trace monoids with idempotent generators and measure-only quantum automata (Q5962066) (← links)
• Deterministic construction of QFAs based on the quantum fingerprinting technique (Q6043928) (← links)
• Computational limitations of affine automata and generalized affine automata (Q6095491) (← links)
• Learning quantum finite automata with queries (Q6149966) (← links)