On the Power of 2-Way Probabilistic Finite State Automata (Extended Abstract)

@inproceedings{Dwork1989OnTP,
  title={On the Power of 2-Way Probabilistic Finite State Automata (Extended Abstract)},
  author={Cynthia Dwork and Larry J. Stockmeyer},
  booktitle={FOCS},
  year={1989}
}
This paper studies the rrcognition powrr of 2-way probabilistic finite state aiitornata (2pfa’s). Although it is known that 2pfa’s can recognize noliregular languages, one of the principal rrsrills shows that: 1. Any 2pfa recognizing a nonregular language must use exponential expected time infinitrly olten. The paper also investigates the power o f intrractivr proof sysferns (IPS’S) where the verifier is a 2pfa. Tt is shown that: ‘IPS’S where thr verifier uses private randomization are strictly… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 21 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 17 references

Computational models of games

ACM distinguished dissertations • 1989

On thc complexily of space bounded interactive proofs

A . Condon, J R.J., ipton
Proc. 30th IEEE Symp. on Foundations of Cornpuler Scrmce • 1989

Stockrneyer, Intrractivr proof systems with finite s ta t r vrrifirrs (preliminary rcport), Report R.J 6262, 1BM Itrsrarch

I C. Dwork
1988

Probabilistic Game Automata

Structure in Complexity Theory Conference • 1986

Similar Papers

Loading similar papers…