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.
in this case the PFSA had a maximum of 20 states with an alphabet cardinality of 8.