The complementation problem for Bu¨chi automata with applications to temporal logic
Theoretical Computer Science
Word problems requiring exponential time(Preliminary Report)
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
Recognizing ?-regular Languages with Probabilistic Automata
LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
Introduction to probabilistic automata (Computer science and applied mathematics)
Introduction to probabilistic automata (Computer science and applied mathematics)
On the Expressiveness and Complexity of Randomization in Finite State Monitors
LICS '08 Proceedings of the 2008 23rd Annual IEEE Symposium on Logic in Computer Science
Synchronizing Automata and the Černý Conjecture
Language and Automata Theory and Applications
On decision problems for probabilistic Büchi automata
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
Reasoning about MDPs as Transformers of Probability Distributions
QEST '10 Proceedings of the 2010 Seventh International Conference on the Quantitative Evaluation of Systems
| Hi-index | 0.00 |
Probabilistic automata are finite-state automata where the transitions are chosen according to fixed probability distributions. We consider a semantics where on an input word the automaton produces a sequence of probability distributions over states. An infinite word is accepted if the produced sequence is synchronizing, i.e. the sequence of the highest probability in the distributions tends to 1. We show that this semantics generalizes the classical notion of synchronizing words for deterministic automata. We consider the emptiness problem, which asks whether some word is accepted by a given probabilistic automaton, and the universality problem, which asks whether all words are accepted. We provide reductions to establish the PSPACE-completeness of the two problems.