Pages that link to "Item:Q2944886"
From MaRDI portal
The following pages link to Complexity of Promise Problems on Classical and Quantum Automata (Q2944886):
Displayed 7 items.
- Promise problems solved by quantum and classical finite automata (Q511009) (← links)
- Quantum finite automata: advances on Bertoni's ideas (Q517033) (← links)
- Unary probabilistic and quantum automata on promise problems (Q1617185) (← links)
- The descriptional power of queue automata of constant length (Q2041686) (← links)
- Boolean language operations on nondeterministic automata with a pushdown of constant height (Q2403237) (← links)
- Descriptional complexity of iterated uniform finite-state transducers (Q5918615) (← links)
- Nonuniform families of polynomial-size quantum finite automata and quantum logarithmic-space computation with polynomial-size advice (Q5919277) (← links)