Pages that link to "Item:Q2503273"

The following pages link to Determination of equivalence between quantum sequential machines (Q2503273):

Displaying 16 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)
• 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)
• Weakly regular quantum grammars and asynchronous quantum automata (Q1013764) (← links)
• A note on quantum sequential machines (Q1029358) (← links)
• Equivalence checking of quantum finite-state machines (Q2220441) (← links)
• Hierarchy and equivalence of multi-letter quantum finite automata (Q2271440) (← 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)
• Determining the equivalence for one-way quantum finite automata (Q2518375) (← links)
• QPSO-CD: quantum-behaved particle swarm optimization algorithm with Cauchy distribution (Q2684300) (← links)
• On the power of two-way multihead quantum finite automata (Q5223828) (← links)
• Quaternionic quantum automata (Q6114652) (← links)
• Learning quantum finite automata with queries (Q6149966) (← links)