Pages that link to "Item:Q579936"

The following pages link to A lower bound for probabilistic algorithms for finite state machines (Q579936):

Displaying 23 items.

• Promise problems solved by quantum and classical finite automata (Q511009) (← links)
• Lower bound for the number of states of purposeful deterministic automata (Q796993) (← links)
• On some variations of two-way probabilistic finite automata models (Q880179) (← links)
• Lower bounds on the area of finite-state machines (Q1115595) (← 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)
• Infinite vs. finite size-bounded randomized computations (Q2637645) (← links)
• On the power of finite automata with both nondeterministic and probabilistic states (preliminary version) (Q2817662) (← links)
• Limits of exact algorithms for inference of minimum size finite state machines (Q3556979) (← links)
• Group Input Machine (Q3599100) (← links)
• Minimal notrivial space complexity of probabilistic one-way Turing machines (Q3976039) (← links)
• Lower Bounds for Las Vegas Automata by Information Theory (Q4462677) (← links)
• Lower space bounds for randomized computation (Q4632458) (← links)
• (Q4733411) (← links)
• SOME LANGUAGES RECOGNIZED BY TWO-WAY FINITE AUTOMATA WITH QUANTUM AND CLASSICAL STATES (Q4902896) (← links)
• Lower bounds for the state complexity of probabilistic languages and the language of prime numbers (Q5108020) (← links)
• CLOSURE PROPERTY OF PROBABILISTIC TURING MACHINES AND ALTERNATING TURING MACHINES WITH SUBLOGARITHMIC SPACES (Q5249267) (← links)
• Probabilistic rebound Turing machines (Q5958328) (← links)