ATOMIC SEMICOMMUTATIONS

被引：2
作者：
CLERBOUT, M
GONZALEZ, D
机构：
[1] LIFL, Université de Lille I
来源：
THEORETICAL COMPUTER SCIENCE | 1994年 / 123卷 / 02期
关键词：
D O I：
10.1016/0304-3975(92)00066-Z
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We define atomic semicommutations as being associated with independence relations the form of which is A x 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.
引用
收藏
页码：259 / 272
页数：14
相关论文
共 23 条
[1]  
AALBERSBERG IJ, 1986, 8616 U LEID DEP COMP
[2]  
AIGNER M, COMBINATORIAL THEORY
[3]  
BERSTEL J, 1986, LECT NOTES COMPUT SC, V233, P15, DOI 10.1007/BFb0016231
[4]  
Berstel J., 1979, TRANSDUCTIONS CONTEX
[5]  
CARTIER P, 1969, LECTURE NOTES MATH, V85
[6]  
CLERBOUT M, 1990, LECT NOTES COMPUT SC, V452, P209, DOI 10.1007/BFb0029610
[7]  
CLERBOUT M, 1990, LECT NOTES COMPUT SC, V443, P501
[8]   PARTIAL COMMUTATIONS AND FAITHFUL RATIONAL TRANSDUCTIONS [J].
CLERBOUT, M ;
LATTEUX, M .
THEORETICAL COMPUTER SCIENCE, 1984, 34 (03) :241-254
[9]   SEMICOMMUTATIONS [J].
CLERBOUT, M ;
LATTEUX, M .
INFORMATION AND COMPUTATION, 1987, 73 (01) :59-74
[10]  
CLERBOUT M, 1986, RAIOR INFORM THEOR, V23, P395
123