Article thumbnail

Atomic semicommutations

By M. Clerbout and D. Gonzalez


AbstractWe define atomic semicommutations as being associated with independence relations the form of which is A × B, in which A and B are two subsets of the alphabet (these two subsets have no common elements). We prove that semicommutations can be decomposed into weaker semicommutations if and only if they are not atomic. We then deduce that every semicommutation can be obtained by a composition of atomic semicommutations, and we suggest a decomposition algorithm

Publisher: Published by Elsevier B.V.
Year: 1994
DOI identifier: 10.1016/0304-3975(92)00066-Z
OAI identifier:

Suggested articles

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.