The complexity of Markov decision processes
Mathematics of Operations Research
On &ohgr;-automata and temporal logic
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
A time complexity gap for two-way probabilistic finite-state automata
SIAM Journal on Computing
A survey of algorithmic methods for partially observed Markov decision processes
Annals of Operations Research
The complexity of probabilistic verification
Journal of the ACM (JACM)
Languages, automata, and logic
Handbook of formal languages, vol. 3
Probabilistic Two-Way Machines
Proceedings on Mathematical Foundations of Computer Science
On the power of quantum finite state automata
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
1-way quantum finite automata: strengths, weaknesses and generalizations
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
On the undecidability of probabilistic planning and related stochastic optimization problems
Artificial Intelligence - special issue on planning with uncertainty and incomplete information
Automata logics, and infinite games: a guide to current research
Automata logics, and infinite games: a guide to current research
Recognizing ?-regular Languages with Probabilistic Automata
LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
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
On the complexity of omega -automata
SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
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
Algorithms for omega-regular games with imperfect information
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
| Hi-index | 0.00 |
Probabilistic ω-automata are variants of nondeterministic automata for infinite words where all choices are resolved by probabilistic distributions. Acceptance of an infinite input word requires that the probability for the accepting runs is positive. In this paper, we provide a summary of the fundamental properties of probabilistic ω-automata concerning expressiveness, efficiency, compositionality and decision problems.