When a symbol is found that does not match a valid transition, the PTA is augmented with a new path to accept the rest of the string.
a Probabilistic Finite State Automaton (PFSA) is merely an automaton with probabilities associated with each transition and final state.