Elsevier

Discrete Applied Mathematics

Volume 131, Issue 3, 28 September 2003, Pages 665-672
Discrete Applied Mathematics

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

https://doi.org/10.1016/S0166-218X(03)00335-4Get rights and content
Under an Elsevier user license
open archive

Abstract

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.

Keywords

Context-free languages
Parikh mapping
Presburger arithmetic
Sets of integers

Cited by (0)

1

F.N.R.S. Postdoctoral Researcher.