The following pages link to (Q4938665):
Displaying 17 items.
- 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 inductive inference by finite automata (Q924168) (← links)
- Mathematical logic and quantum finite state automata (Q1017412) (← links)
- Exact results for accepting probabilities of quantum automata. (Q1401229) (← links)
- Quantum versus deterministic counter automata (Q1779306) (← links)
- One-way probabilistic reversible and quantum one-counter automata. (Q1853577) (← links)
- Regular languages accepted by quantum automata (Q1854417) (← links)
- Finite state and finite stop quantum languages (Q2506022) (← links)
- Quantum Automata Theory – A Review (Q3098037) (← links)
- Note on the Succinctness of Deterministic, Nondeterministic, Probabilistic and Quantum Finite Automata (Q3149086) (← links)
- Languages Recognized with Unbounded Error by Quantum Finite Automata (Q3392970) (← links)
- (Q3464375) (← links)
- (Q3990820) (← links)
- Deterministic construction of QFAs based on the quantum fingerprinting technique (Q6043928) (← links)
- Quantum bounds for 2D-grid and Dyck language (Q6101583) (← links)
- Eilenberg's variety theorem without Boolean operations (Q6186309) (← links)