The commutative closure of a binary slip-language is context-free: a new proof

Using original arguments about sets of integers satisfying some first-order formula of the Presburger arithmetic <N, +>, we give a new proof that the commutative closure of a slip-language over a two letters alphabet is context-free. (C) 2003 Elsevier B.V. All rights reserved.