A lower bound for probabilistic algorithms for finite state machines
Journal of Computer and System Sciences
Private coins versus public coins in interactive proof systems
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Estimating a probability using finite memory
IEEE Transactions on Information Theory
Trading group theory for randomness
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Journal of Computer and System Sciences - Structure in Complexity Theory Conference, June 2-5, 1986
The knowledge complexity of interactive proof systems
SIAM Journal on Computing
A time complexity gap for two-way probabilistic finite-state automata
SIAM Journal on Computing
Running time to recognize nonregular languages by 2-way probabilistic automata
Proceedings of the 18th international colloquium on Automata, languages and programming
Finite state verifiers II: zero knowledge
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Probabilistic Two-Way Machines
Proceedings on Mathematical Foundations of Computer Science
Finite state verifiers II: zero knowledge
Journal of the ACM (JACM)
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Probabilistic rebound Turing machines
Theoretical Computer Science
Two-way finite automata with quantum and classical states
Theoretical Computer Science - Natural computing
Hyper-Encryption and Everlasting Security
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Oblivious Transfer in the Bounded Storage Model
CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
PSPACE has constant-round quantum interactive proof systems
Theoretical Computer Science - Algorithms,automata, complexity and games
PSPACE Has Constant-Round Quantum Interactive Proof Systems
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Fast approximate probabilistically checkable proofs
Information and Computation
Beyond NP: the work and legacy of Larry Stockmeyer
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
On some variations of two-way probabilistic finite automata models
Theoretical Computer Science
Delegating computation: interactive proofs for muggles
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Some Observations on Two-Way Finite Automata with Quantum and Classical States
ICIC '08 Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Theoretical and Methodological Issues
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
An application of quantum finite automata to interactive proof systems
Journal of Computer and System Sciences
Theory of one-tape linear-time Turing machines
Theoretical Computer Science
Information Sciences: an International Journal
A space lower bound of two-dimensional probabilistic turing machines
DLT'02 Proceedings of the 6th international conference on Developments in language theory
Finite state transducers with intuition
UC'10 Proceedings of the 9th international conference on Unconventional computation
UC'11 Proceedings of the 10th international conference on Unconventional computation
An application of quantum finite automata to interactive proof systems (extended abstract)
CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
On some variations of two-way probabilistic finite automata models
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
Multiple usage of random bits in finite automata
TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
Finite state verifiers with constant randomness
CiE'12 Proceedings of the 8th Turing Centenary conference on Computability in Europe: how the world computes
State succinctness of two-way finite automata with quantum and classical states
Theoretical Computer Science
FCT'13 Proceedings of the 19th international conference on Fundamentals of Computation Theory
| Hi-index | 0.01 |
An investigation of interactive proof systems (IPSs) where the verifier is a 2-way probabilistic finite state automaton (2pfa) is initiated. In this model, it is shown:(1) IPSs in which the verifier uses private randomization are strictly more powerful than IPSs in which the random choices of the verifier are made public to the prover.(2) IPSs in which the verifier uses public randomization are strictly more powerful than 2pfa's alone, that is, without a prover.(3) Every language which can be accepted by some deterministic Turing machine in exponential time can be accepted by some IPS.Additional results concern two other classes of verifiers: 2pfa's that halt in polynomial expected time, and 2-way probabilistic pushdown automata that halt in polynomial time. In particular, IPSs with verifiers in the latter class are as powerful as IPSs where verifiers are polynomial-time probabilistic Turing machines. In a companion paper [7], zero knowledge IPSs with 2pfa verifiers are investigated.