The following pages link to (Q2762497):
Displaying 20 items.
- Another approach to the equivalence of measure-many one-way quantum finite automata and its application (Q439940) (← links)
- One-way reversible and quantum finite automata with advice (Q476173) (← links)
- Improved constructions of quantum automata (Q1017403) (← links)
- Efficient probability amplification in two-way quantum finite automata (Q1017406) (← links)
- On a class of languages recognizable by probabilistic reversible decide-and-halt automata (Q1017410) (← links)
- Exact results for accepting probabilities of quantum automata. (Q1401229) (← links)
- Quantum versus deterministic counter automata (Q1779306) (← links)
- On language varieties without Boolean operations (Q2232259) (← links)
- Hierarchy and equivalence of multi-letter quantum finite automata (Q2271440) (← links)
- Some formal tools for analyzing quantum automata. (Q2490805) (← links)
- Interactive proofs with quantum finite automata (Q2513604) (← links)
- Quantum Automata Theory – A Review (Q3098037) (← links)
- Quantum finite automata with control language (Q3431442) (← links)
- Lower Bounds for Generalized Quantum Finite Automata (Q3540128) (← links)
- On the Size of One-way Quantum Finite Automata with Periodic Behaviors (Q4800259) (← links)
- (Q4988166) (← links)
- Quantum State Complexity of Formal Languages (Q5500700) (← links)
- Improved Constructions of Quantum Automata (Q5503296) (← links)
- Deterministic construction of QFAs based on the quantum fingerprinting technique (Q6043928) (← links)
- Eilenberg's variety theorem without Boolean operations (Q6186309) (← links)
