Pages that link to "Item:Q690502"
From MaRDI portal
The following pages link to On the complexity of minimizing probabilistic and quantum automata (Q690502):
Displaying 11 items.
- Exponentially more concise quantum recognition of non-RMM regular languages (Q473186) (← links)
- Promise problems solved by quantum and classical finite automata (Q511009) (← links)
- Multi-letter quantum finite automata: decidability of the equivalence and minimization of states (Q766174) (← links)
- Categories of quantale-valued fuzzy automata: determinization and minimization (Q2053055) (← links)
- Equivalence checking of quantum finite-state machines (Q2220441) (← links)
- Power of the interactive proof systems with verifiers modeled by semi-quantum two-way finite automata (Q2343133) (← links)
- On hybrid models of quantum finite automata (Q2353395) (← links)
- On the power of two-way multihead quantum finite automata (Q5223828) (← links)
- (Q5232904) (← links)
- Matrix approach to simplification of finite state machines using semi-tensor product of matrices (Q6570397) (← links)
- Quantum Büchi automata (Q6593677) (← links)
