 In the generalization to QFAs, the set of recognized languages will be different.Describing that set is one of the outstanding research problems in QFA theory.Another generalization that should be immediately apparent is to use a stochastic matrix for the transition matrices, and a probability vector for the state; this gives a probabilistic finite automaton.