Given two subsets S 1, S 2 of N k, we say that S 1 is commutatively equivalent to S 2 if there
exists a bijection f: S 1⟶ S 2 from S 1 onto S 2 such that, for every v∈ S 1,| v|=| f (v)|, where …

Theoretical Computer Science The Parikh counting functions of sparse context-free languages
are quasi-polynomials$ Page 1 Theoretical Computer Science 410 (2009) 5158–5181 …

Deciding whether the ordering is necessary in a Presburger formula Page 1 Discrete
Mathematics and Theoretical Computer Science DMTCS vol. 12:1, 2010, 20–38 Deciding …

We investigate the family of semi-linear sets of Nt and Zt. We study the growth function of
semi-linear sets and we prove that such a function is a piecewise quasi-polynomial on a …

Let $ X $ be a subset of $\N^ t $ or $\Z^ t $. We can associate with $ X $ a function ${\cal G}
_X:\N^ t\longrightarrow\N $ which returns, for every $(n_1,..., n_t)\in\N^ t $, the number ${\cal …

We consider logics on Z and N which are weaker than Presburger Arithmetic and we settle
the following decision problem: given a k-ary relation on Z and N which is first order …