Multiple usage of random bits in finite automata

Authors:
Rūsiņš Freivalds
Affiliations:
Institute of Mathematics and Computer Science, University of Latvia, Rīga, Latvia
Venue:
TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
Year:
2012

Citing 12
Cited 0

Private coins versus public coins in interactive proof systems

STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
The knowledge complexity of interactive proof-systems

STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Arthur-Merlin games: a randomized proof system, and a hierarchy of complexity class

Journal of Computer and System Sciences - 17th Annual ACM Symposium in the Theory of Computing, May 6-8, 1985
Private vs. common random bits in communication complexity

Information Processing Letters
Finite state verifiers I: the power of interaction

Journal of the ACM (JACM)
An introduction to Kolmogorov complexity and its applications (2nd ed.)

An introduction to Kolmogorov complexity and its applications (2nd ed.)
Probabilistic Two-Way Machines

Proceedings on Mathematical Foundations of Computer Science
Complexity of Probabilistic Versus Deterministic Automata

Baltic Computer Science, Selected Papers
Polynomial time quantum computation with advice

Information Processing Letters
Theory of one-tape linear-time Turing machines

Theoretical Computer Science
Process complexity and effective random tests

Journal of Computer and System Sciences
Amount of nonconstructivity in deterministic finite automata

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Finite automata with random bits written on a separate 2-way readable tape can recognize languages not recognizable by probabilistic finite automata. This shows that repeated reading of random bits by finite automata can have big advantages over one-time reading of random bits.