Elsevier

Theoretical Computer Science

Volume 562, 11 January 2015, Pages 476-495
Theoretical Computer Science

On the commutative equivalence of semi-linear sets of Nk

https://doi.org/10.1016/j.tcs.2014.10.030Get rights and content
Under an Elsevier user license
open archive

Abstract

Given two subsets S1,S2 of Nk, we say that S1 is commutatively equivalent to S2 if there exists a bijection f:S1S2 from S1 onto S2 such that, for every vS1, |v|=|f(v)|, where |v| denotes the sum of the components of v. We prove that every semi-linear set of Nk is commutatively equivalent to a recognizable subset of Nk.

Keywords

Semilinear set
Recognizable set
Commutative equivalence

Cited by (0)