In mathematics and computer science, the probabilistic automaton is a generalization of the nondeterministic finite automaton; it includes the probability of a given transition into the transition function, turning it into a transition matrix. Wikipedia