The latter automaton uses integers as state names: it is 0 xn −→ n .
it removes γ i:j , e x i and e x j+1 and in fact, it is precisely a weighting of the edits in our original FST F , without further considering the context in which an edit is applied.