... of the initial state, the weight of all the tran-sitions, and the final weight of the final state. Whenseveral paths in the WFST match the same relation, the total cost is the sum (⊕) of the ... transducers, if the signature for the twostates do not match, then they cannot have the sameright language and therefore cannot be equivalent.Otherwise, if the two states are final, then theirweights ... QAandmerge pairs of equivalent states until there are notwo equivalent states in the transducer. An advan-tage of this method is that at any time of the appli-cation of the algorithm, the transducer...