AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
The theory of trackability with applications to sensor networks
ACM Transactions on Sensor Networks (TOSN)
Delegating computation: interactive proofs for muggles
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Reasoning about actions with sensing under qualitative and probabilistic uncertainty
ACM Transactions on Computational Logic (TOCL)
On the expressiveness and complexity of randomization in finite state monitors
Journal of the ACM (JACM)
Power of Randomization in Automata on Infinite Strings
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Complexity of probabilistic planning under average rewards
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Probabilistic Büchi automata with non-extremal acceptance thresholds
VMCAI'11 Proceedings of the 12th international conference on Verification, model checking, and abstract interpretation
Language equivalence for probabilistic automata
CAV'11 Proceedings of the 23rd international conference on Computer aided verification
Recursive markov decision processes and recursive stochastic games
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
On the complexity of the equivalence problem for probabilistic automata
FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures
Deciding the Value 1 Problem for Probabilistic Leaktight Automata
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Finite state verifiers with constant randomness
CiE'12 Proceedings of the 8th Turing Centenary conference on Computability in Europe: how the world computes
| Hi-index | 0.01 |
Two results on interactive proof systems with two-way probabilistic finite-state verifiers are proved. The first is a lower bound on the power of such proof systems if they are not required to halt with high probability on rejected inputs: it is shown that they can accept any recursively enumerable language. The second is an upper bound on the power of interactive proof systems that halt with high probability on all inputs. The proof method for the lower bound also shows that the emptiness problem for one-way probabilistic finite-state machines is undecidable. In the proof of the upper bound some results of independent interest on the rate of convergence of time-varying Markov chains to their halting states are obtained.