Pages that link to "Item:Q579936"
From MaRDI portal
The following pages link to A lower bound for probabilistic algorithms for finite state machines (Q579936):
Displaying 14 items.
- Promise problems solved by quantum and classical finite automata (Q511009) (← links)
- On some variations of two-way probabilistic finite automata models (Q880179) (← links)
- A note on two-way probabilistic automata (Q1195495) (← links)
- A note on two-dimensional probabilistic finite automata (Q1298347) (← 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)
- Two-way finite automata with quantum and classical states. (Q1853472) (← links)
- Affine automata verifiers (Q2152088) (← links)
- Power of the interactive proof systems with verifiers modeled by semi-quantum two-way finite automata (Q2343133) (← links)
- Group Input Machine (Q3599100) (← links)
- Lower space bounds for randomized computation (Q4632458) (← links)
- SOME LANGUAGES RECOGNIZED BY TWO-WAY FINITE AUTOMATA WITH QUANTUM AND CLASSICAL STATES (Q4902896) (← links)
- CLOSURE PROPERTY OF PROBABILISTIC TURING MACHINES AND ALTERNATING TURING MACHINES WITH SUBLOGARITHMIC SPACES (Q5249267) (← links)
- Probabilistic rebound Turing machines (Q5958328) (← links)
