Probabilistic Automata of Bounded Ambiguity

    CONCUR, pp. 19:1-19:14, 2017.

    Cited by: 11|Bibtex|Views6|Links
    EI

    Abstract:

    Probabilistic automata are a computational model introduced by Michael Rabin, extending nondeterministic finite automata with probabilistic transitions. Despite its simplicity, this model is very expressive and many of the associated algorithmic questions are undecidable. In this work we focus on the emptiness problem, which asks whether ...More

    Code:

    Data:

    Your rating :
    0

     

    Tags
    Comments