Pages that link to "Item:Q1617185"
From MaRDI portal
The following pages link to Unary probabilistic and quantum automata on promise problems (Q1617185):
Displaying 16 items.
- Superiority of exact quantum automata for promise problems (Q413305) (← links)
- Promise problems solved by quantum and classical finite automata (Q511009) (← links)
- Quantum finite automata: advances on Bertoni's ideas (Q517033) (← links)
- Unary probabilistic and quantum automata on promise problems (Q1617185) (← links)
- Finite automata capturing winning sequences for all possible variants of the \(PQ\) penny flip game (Q1657268) (← links)
- Two-way and one-way quantum and classical automata with advice for online minimization problems (Q2139057) (← links)
- Quantum online streaming algorithms with logarithmic memory (Q2241048) (← links)
- Language Recognition Power and Succinctness of Affine Automata (Q2819147) (← links)
- On the size of unary probabilistic and nondeterministic automata (Q2882386) (← links)
- Complexity of Promise Problems on Classical and Quantum Automata (Q2944886) (← links)
- Classical and Quantum Counter Automata on Promise Problems (Q2947425) (← links)
- (Q3451107) (redirect page) (← links)
- Quantum versus classical online streaming algorithms with logarithmic size of memory (Q6043926) (← links)
- Deterministic construction of QFAs based on the quantum fingerprinting technique (Q6043928) (← links)
- Language recognition power and succinctness of affine automata (Q6061995) (← links)
- Mirrors and memory in quantum automata (Q6160780) (← links)