Decomposition of Partial Commutations

We define atomic partial commutations that are associated to independence relations of the form A1×A2 ∪ A2×A1 where A1, A2 are two disjoint subsets of the alphabet. Then we prove that each partial commutation can be obtained as the composition of atomic partial commutations.

[1]  Mireille Clerbout,et al.  Decomposition of Semi Commutations , 1990, MFCS.

[2]  Michel Latteux,et al.  Rational Cones and Commutations , 1988, IMYCS.

[3]  Dominique Perrin.  Words over a Partially Commutative Alphabet , 1985 .

[4]  Pierre Cartier,et al.  Problemes combinatoires de commutation et rearrangements , 1969 .

[5]  M. Clerbout,et al.  Semi-commutations , 1987, Inf. Comput..

[6]  Robert Cori,et al.  Automates et Commutations Partielles , 1985, RAIRO Theor. Informatics Appl..

[7]  Antoni W. Mazurkiewicz,et al.  Traces, Histories, Graphs: Instances of a Process Monoid , 1984, International Symposium on Mathematical Foundations of Computer Science.

[8]  Grzegorz Rozenberg,et al.  Theory of Traces , 1988, Theor. Comput. Sci..

[9]  Michel Latteux,et al.  Partial Commutations and Faithful Rational Transductions , 1984, Theor. Comput. Sci..

[10]  A. Mazurkiewicz.  Concurrent Program Schemes and their Interpretations , 1977 .

[11]  Yves Métivier.  On Recognizable Subsets of Free Partially Commutative Monoids , 1988, Theor. Comput. Sci..

[12]  Edward Ochmanski,et al.  Regular behaviour of concurrent systems , 1985, Bull. EATCS.

[13]  Jacques Sakarovitch,et al.  Recent Results in the Theory of Rational Sets , 1986, MFCS.

[14]  Wieslaw Zielonka,et al.  Notes on Finite Asynchronous Automata , 1987, RAIRO Theor. Informatics Appl..

[15]  Yves Roos,et al.  Contribution a l'étude des fonctions de commutation partielle , 1989 .

[16]  Jean Berstel,et al.  Transductions and context-free languages , 1979, Teubner Studienbücher : Informatik.

[17]  Mireille Clerbout.  Compositions De Fonctions De Commutation Partielle , 1989, RAIRO Theor. Informatics Appl..