Epsilon-closure and DFA minimization algorithms for probabilistic NFA Are there any algorithms performing e-closures and DFA minimizations for probabilistic Finite Automata? Given that probabilistic NFAs might have multiple accepting paths for generating equivalent strings with different probabilities, do current minimization algorithms allow to reduce such amount of complexity to generating just one string with given fixed probability?
I am aware of e-closure and DFA minimization for standard Finite Automata, but I was able to find no paper/algorithm for automata with probabilities.
Stefan Kiefer has some work on minimization of probabilistic automata. This should probably put you on the right track:
https://arxiv.org/abs/1404.6673.