Samuel Pottle

Learn More
We study finite automata with both nondeterministic and random states (npfa's). We restrict our attention to those npfa's that accept their languages with a small probability of error and run in polynomial expected time. Equivalently , we study Arthur-Merlin games where the players are limited to polynomial time and constant space. Dwork and Stockmeyer(More)
  • 1