Pages that link to "Item:Q2271440"
From MaRDI portal
The following pages link to Hierarchy and equivalence of multi-letter quantum finite automata (Q2271440):
Displaying 14 items.
- State succinctness of two-way finite automata with quantum and classical states (Q391188) (← links)
- 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)
- Promise problems solved by quantum and classical finite automata (Q511009) (← links)
- Two-tape finite automata with quantum and classical states (Q539559) (← 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)
- A note on quantum sequential machines (Q1029358) (← links)
- On coverings of products of uninitialized sequential quantum machines (Q2323760) (← links)
- QPSO-CD: quantum-behaved particle swarm optimization algorithm with Cauchy distribution (Q2684300) (← links)
- One-Way Finite Automata with Quantum and Classical States (Q3166958) (← links)
- SOME LANGUAGES RECOGNIZED BY TWO-WAY FINITE AUTOMATA WITH QUANTUM AND CLASSICAL STATES (Q4902896) (← links)
- On the power of two-way multihead quantum finite automata (Q5223828) (← links)
- Mirrors and memory in quantum automata (Q6160780) (← links)