The following pages link to (Q3171611):
Displaying 22 items.
- State succinctness of two-way finite automata with quantum and classical states (Q391188) (← links)
- Unbounded-error quantum computation with small space bounds (Q550246) (← links)
- Unary probabilistic and quantum automata on promise problems (Q1617185) (← links)
- Quantum computation with write-only memory (Q1761714) (← links)
- More on quantum, stochastic, and pseudo stochastic languages with few states (Q2003453) (← links)
- Improved constructions for succinct affine automata (Q2096598) (← links)
- Affine automata verifiers (Q2152088) (← links)
- Quantum alternation (Q2361668) (← links)
- Very narrow quantum OBDDs and width hierarchies for classical OBDDs (Q2361670) (← links)
- Nondeterministic unitary OBDDs (Q2399370) (← links)
- Language Recognition Power and Succinctness of Affine Automata (Q2819147) (← links)
- Looking for Pairs that Hard to Separate: A Quantum Approach (Q2830222) (← links)
- Quantum Finite Automata: A Modern Introduction (Q2944891) (← links)
- Languages Recognized with Unbounded Error by Quantum Finite Automata (Q3392970) (← links)
- On a Conjecture by Christian Choffrut (Q4605510) (← links)
- Uncountable classical and quantum complexity classes (Q5223610) (← links)
- (Q5232904) (← links)
- Affine Computation and Affine Automaton (Q5740183) (← links)
- Nonuniform families of polynomial-size quantum finite automata and quantum logarithmic-space computation with polynomial-size advice (Q5919277) (← links)
- Deterministic construction of QFAs based on the quantum fingerprinting technique (Q6043928) (← links)
- Language recognition power and succinctness of affine automata (Q6061995) (← links)
- Computational limitations of affine automata and generalized affine automata (Q6095491) (← links)
