M.: Efficient Algorithms for Testing the Twins Property. J. of Automata, Languages and Combinatorics 8(2) (2003) 117–144 A Formal proofs We will often use the following observation, which can be shown by elementary computations. Observation 16 For every k (0)

by C Allauzen, Mohri
Venue:µM(σ)(a1 · u ′ 1 , . . . , ak · u ′ k ) ((f, g) factorization) = a1 · . . . · ak · µM(σ)(u ′ 1, . . .,u ′ k) . (Obs. 16) First, let µM(σ)(u1