Finite state verifiers with constant randomness

Authors:
A. C. Cem Say;Abuzer Yakaryılmaz
Affiliations:
Department of Computer Engineering, Boğaziçi University, Bebek, İstanbul, Turkey;Faculty of Computing, University of Latvia, Rīga, Latvia
Venue:
CiE'12 Proceedings of the 8th Turing Centenary conference on Computability in Europe: how the world computes
Year:
2012

Citing 13
Cited 0

Private coins versus public coins in interactive proof systems

STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
A time complexity gap for two-way probabilistic finite-state automata

SIAM Journal on Computing
Space-bounded probabilistic game automata

Journal of the ACM (JACM)
Finite state verifiers I: the power of interaction

Journal of the ACM (JACM)
IP = PSPACE

Journal of the ACM (JACM)
The complexity of space bounded interactive proof systems

Complexity theory
Interactive proof systems with polynomially bounded strategies

Journal of Computer and System Sciences
The complexity of the max word problem and the power of one-way interactive proof systems

Computational Complexity
Space-Efficient Deterministic Simulation of Probabilistic Automata

SIAM Journal on Computing
Probabilistic Two-Way Machines

Proceedings on Mathematical Foundations of Computer Science
Running Time to Recognize Nonregular Languages by 2-Way Probabilistic Automata

ICALP '91 Proceedings of the 18th International Colloquium on Automata, Languages and Programming
On the complexity of space bounded interactive proofs

SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
Complexity of multi-head finite automata: Origins and directions

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.