Pages that link to "Item:Q3392970"
From MaRDI portal
The following pages link to Languages Recognized with Unbounded Error by Quantum Finite Automata (Q3392970):
Displaying 12 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)
- Unbounded-error quantum computation with small space bounds (Q550246) (← links)
- A new family of nonstochastic languages (Q656590) (← links)
- Characterizations of one-way general quantum finite automata (Q764358) (← links)
- Multi-letter quantum finite automata: decidability of the equivalence and minimization of states (Q766174) (← links)
- Simulation methods for quantum walks on graphs applied to formal language recognition (Q1646243) (← links)
- More on quantum, stochastic, and pseudo stochastic languages with few states (Q2003453) (← links)
- Affine automata verifiers (Q2152088) (← links)
- Language Recognition Power and Succinctness of Affine Automata (Q2819147) (← links)
- Affine Computation and Affine Automaton (Q5740183) (← links)
- Language recognition power and succinctness of affine automata (Q6061995) (← links)
