Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
436155 | Theoretical Computer Science | 2015 | 20 Pages |
Abstract
Given two subsets S1,S2S1,S2 of NkNk, we say that S1S1 is commutatively equivalent to S2S2 if there exists a bijection f:S1⟶S2f:S1⟶S2 from S1S1 onto S2S2 such that, for every v∈S1v∈S1, |v|=|f(v)||v|=|f(v)|, where |v||v| denotes the sum of the components of v. We prove that every semi-linear set of NkNk is commutatively equivalent to a recognizable subset of NkNk.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Flavio D'Alessandro, Benedetto Intrigila,