Pages that link to "Item:Q2819568"
From MaRDI portal
The following pages link to Undecidability on quantum finite automata (Q2819568):
Displaying 16 items.
- Another approach to the equivalence of measure-many one-way quantum finite automata and its application (Q439940) (← links)
- Unbounded-error quantum computation with small space bounds (Q550246) (← links)
- Characterizations of one-way general quantum finite automata (Q764358) (← links)
- Unsolvability of the halting problem in quantum dynamics (Q1008077) (← links)
- An application of quantum finite automata to interactive proof systems (Q1015813) (← links)
- A note on quantum sequential machines (Q1029358) (← links)
- Quantum versus deterministic counter automata (Q1779306) (← links)
- Hierarchy and equivalence of multi-letter quantum finite automata (Q2271440) (← links)
- On hybrid models of quantum finite automata (Q2353395) (← links)
- Determining the equivalence for one-way quantum finite automata (Q2518375) (← links)
- Classical and Quantum Counter Automata on Promise Problems (Q2947425) (← links)
- (Un)decidable Problems about Reachability of Quantum Systems (Q3190137) (← links)
- On Models of a Nondeterministic Computation (Q3392968) (← links)
- Languages Recognized with Unbounded Error by Quantum Finite Automata (Q3392970) (← links)
- On the power of two-way multihead quantum finite automata (Q5223828) (← links)
- Quaternionic quantum automata (Q6114652) (← links)