We have where σ 1 and σ 2 are as in the la k case, and we have set Transitions la k and ra k are parametric in k, where k is bounded by the length of the input string and not by a fixed constant (but see also the experimental findings in §5).
our system uses an unbounded number of transition relations, which has an apparent disadvantage for learning algorithms.