Finite State Verifiers with Constant Randomness
We give a new characterization of NL as the class of languages whose members have certificates that can be verified with small error in polynomial time by finite state machines that use a constant number of random bits, as opposed to its conventional description in terms of deterministic logarithmic-space verifiers. It turns out that allowing two-way interaction with the prover does not change the class of verifiable languages, and that no polynomially bounded amount of randomness is useful for constant-memory computers when used as language recognizers, or public-coin verifiers.
KeywordsRegular Language Input String Input Tape Nondeterministic Choice Probabilistic Automaton
Unable to display preview. Download preview PDF.
- 1.Condon, A.: Computational Models of Games. MIT Press (1989)Google Scholar
- 4.Condon, A.: The complexity of space bounded interactive proof systems. In: Complexity Theory: Current Research, pp. 147–190. Cambridge University Press (1993)Google Scholar
- 6.Condon, A., Lipton, R.J.: On the complexity of space bounded interactive proofs. In: Proceedings of the 30th Annual Symposium on Foundations of Computer Science. pp. 462–467 (1989), http://portal.acm.org/citation.cfm?id=1398514.1398732
- 9.Freivalds, R.: Probabilistic two-way machines. In: Proceedings of the International Symposium on Mathematical Foundations of Computer Science, pp. 33–45 (1981)Google Scholar
- 10.Goldwasser, S., Sipser, M.: Private coins versus public coins in interactive proof systems. In: Proceedings of the 18th Annual ACM Symposium on Theory of Computing (STOC 1986), pp. 59–68 (1986)Google Scholar
- 13.Kaņeps, J.: Stochasticity of the languages acceptable by two-way finite probabilistic automata. Diskretnaya Matematika 1, 63–67 (1989) (Russian)Google Scholar