Pages that link to "Item:Q690502"

The following pages link to On the complexity of minimizing probabilistic and quantum automata (Q690502):

Displaying 2 items.

• Exponentially more concise quantum recognition of non-RMM regular languages (Q473186) (← links)
• Multi-letter quantum finite automata: decidability of the equivalence and minimization of states (Q766174) (← links)