A Time Complexity Gap for Two-Way Probabilistic Finite-State Automata

@article{Dwork1990ATC,
  title={A Time Complexity Gap for Two-Way Probabilistic Finite-State Automata},
  author={Cynthia Dwork and Larry J. Stockmeyer},
  journal={SIAM J. Comput.},
  year={1990},
  volume={19},
  pages={1011-1023}
}
It is shown that if a 2-way probabilistic nite state automaton (2pfa) M recognizes a nonregular language L with error probability bounded below 1/2, then there is a positive constant b (depending on M) such that, for innnitely many inputs x, the expected running time of M on input x must exceed 2 n b where n is the length of x. This complements a result of Freivalds showing that 2pfa's can recognize certain nonregular languages in exponential expected time. It also establishes a time complexity… CONTINUE READING
Highly Influential
This paper has highly influenced 11 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS

References

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

Interactive proof systems with nite state veri ers, Report RJ 6262

  • C. Dwork, L. Stockmeyer
  • IBM Research Division,
  • 1988
1 Excerpt

The Markov chain tree theorem

  • F. T. Leighton, R. L. Rivest
  • Report MIT/LCS/TM-249, Laboratory for Computer…
  • 1983
1 Excerpt

Similar Papers

Loading similar papers…