Abstract
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. © Springer-Verlag Berlin Heidelberg 2009.
Cite
CITATION STYLE
Baier, C., Bertrand, N., & Größer, M. (2009). Probabilistic acceptors for languages over infinite words. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5404 LNCS, pp. 19–33). https://doi.org/10.1007/978-3-540-95891-8_3
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
