Pages that link to "Item:Q675857"
From MaRDI portal
The following pages link to Multihead two-way probabilistic finite automata (Q675857):
Displayed 9 items.
- The complexity of debate checking (Q493647) (← links)
- Decreasing the bandwidth of a transition matrix (Q673904) (← links)
- Properties of probabilistic pushdown automata (Q1274989) (← links)
- A note on two-dimensional probabilistic finite automata (Q1298347) (← links)
- Bits and relative order from residues, space efficiently (Q1327295) (← links)
- Amplification of slight probabilistic advantage at absolutely no cost in space (Q1607005) (← links)
- Closure properties of the classes of sets recognized by space-bounded two-dimensional probabilistic Turing machines (Q1818780) (← links)
- A note on two-dimensional probabilistic Turing machines (Q1818955) (← links)
- Complexity Bounds of Constant-Space Quantum Computation (Q3451121) (← links)