This criterion is coded by means of two variables: k, representing the length of the sequence of w0.s2 w0.s0 w0.s1 w0.s0 w0.s0 w0.s1 w0.s0 The result of merging states in Figure 4 with the same incoming paths of length 2. incoming edges with the same symbols for both states (describing left context of the state under consideration for merging) and l, representing the length of the sequence of outgoing edges with the same symbol for both states (describing its right context in the prefix tree).
two states are placed in the same part of the partitioning if Algorithm 2 Learning algorithm incorporating k-testable and k, l-local merging.