Pages that link to "Item:Q5500700"
From MaRDI portal
The following pages link to Quantum State Complexity of Formal Languages (Q5500700):
Displaying 4 items.
- Quantum finite automata: advances on Bertoni's ideas (Q517033) (← links)
- A SCHEMATIC DEFINITION OF QUANTUM POLYNOMIAL TIME COMPUTABILITY (Q5858921) (← links)
- How does adiabatic quantum computation fit into quantum automata theory? (Q5918616) (← links)
- Nonuniform families of polynomial-size quantum finite automata and quantum logarithmic-space computation with polynomial-size advice (Q5919277) (← links)
