• We prove that {a k bc | 0 ≤ k ≤ n} ⊆ L(G n ) using the following properties: we get: • The condition A B is crucial for strictness of language inclusion.
: • This construction is in some sense more complex than those for the other systems (Foret and Le Nir, 2002a;Foret and Le Nir, 2002b) since they do not directly translate as limit points in the more restricted system NL.