Pages that link to "Item:Q766174"
From MaRDI portal
The following pages link to Multi-letter quantum finite automata: decidability of the equivalence and minimization of states (Q766174):
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)
- Characterizations of one-way general quantum finite automata (Q764358) (← links)
- Equivalence checking of quantum finite-state machines (Q2220441) (← links)
- Periodic generalized automata over the reals (Q2280333) (← links)
- On coverings of products of uninitialized sequential quantum machines (Q2323760) (← links)
- On hybrid models of quantum finite automata (Q2353395) (← links)
- QPSO-CD: quantum-behaved particle swarm optimization algorithm with Cauchy distribution (Q2684300) (← links)
- From Quantum Query Complexity to State Complexity (Q2944893) (← links)
- On the power of two-way multihead quantum finite automata (Q5223828) (← links)
- Learning quantum finite automata with queries (Q6149966) (← links)
