Semi-commutations and partial commutations
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 34 (2000) no. 4, pp. 307-330. 
@article{ITA_2000__34_4_307_0,
     author = {Clerbout, M. and Roos, Y. and Ryl, I.},
     title = {Semi-commutations and partial commutations},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     pages = {307--330},
     publisher = {EDP-Sciences},
     volume = {34},
     number = {4},
     year = {2000},
     mrnumber = {1809863},
     zbl = {0970.68087},
     language = {en},
     url = {http://www.numdam.org/item/ITA_2000__34_4_307_0/}
}
TY  - JOUR
AU  - Clerbout, M.
AU  - Roos, Y.
AU  - Ryl, I.
TI  - Semi-commutations and partial commutations
JO  - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY  - 2000
SP  - 307
EP  - 330
VL  - 34
IS  - 4
PB  - EDP-Sciences
UR  - http://www.numdam.org/item/ITA_2000__34_4_307_0/
LA  - en
ID  - ITA_2000__34_4_307_0
ER  - 
%0 Journal Article
%A Clerbout, M.
%A Roos, Y.
%A Ryl, I.
%T Semi-commutations and partial commutations
%J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
%D 2000
%P 307-330
%V 34
%N 4
%I EDP-Sciences
%U http://www.numdam.org/item/ITA_2000__34_4_307_0/
%G en
%F ITA_2000__34_4_307_0
Clerbout, M.; Roos, Y.; Ryl, I. Semi-commutations and partial commutations. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 34 (2000) no. 4, pp. 307-330. http://www.numdam.org/item/ITA_2000__34_4_307_0/

[1] A. Arnold, An extension of the notions of traces and of asynchronous automata. Theoret. Informatics Appl. 25 (1991), 355-393. | Numdam | MR | Zbl

[2] M. Clerbout, Commutations Partielles et Familles de Langages. Ph. D. Thesis, Université des Sciences et Technologies de Lille (1984).

[3] M. Clerbout and D. Gonzalez, Atomic semi-commutations. Theoret. Comput. Sci. 123 (1994) 259-272. | MR | Zbl

[4] M. Clerbout and M. Latteux, Partial commutations and faithful rational transductions. Theoret Comput. Sci. 34 (1984) 241-254. | MR | Zbl

[5] M. Clerbout and M. Latteux, Semi-commutations, Inform. and Comput. 73 (1987) 59-74. | Zbl

[6] M. Clerbout, M. Latteux, Y. Roos and W. Zielonka, Semi-commutations and rational expressions, in Proc. 19th International Colloquium on Automata Languages and Programrning (ICALP'92), edited by W. Kuich. Springer, Lecture Notes in Comput. Sel 623 (1992) 113-125. | MR

[7] V. Diekert and G. Rozenberg, The Book of Traces. World Scientific, Singapore (1995). | MR

[8] C. C. Elgot and J. E. Mezei, On relations defined by generalized finite automata. IBM J. Res. Develop. 9 (1965) 47-68. | MR | Zbl

[9] S. Ginsburg and S. A. Greibach Principal AFL. J. Comput System Sci. 4 (1970) 308-338. | MR | Zbl

[10] S. Ginsburg, The Mathemetical Theory of Context-Free Languages. McGraw-Hill (1966). | MR | Zbl

[11] J. F. Husson, Modélisation de la Causalité par des Relations d'Indépendance. Ph. D. Thesis, Université Paul Sabatier, Toulouse (1996).

[12] M. Latteux, Cônes rationnels commutativement clos. Theoret. Informatics Appl. 11 (1977) 29-51. | Numdam | MR | Zbl

[13] A. Mazurkiewicz, Concurrent program schemes and their interpretations. DAIMI Rep. PB 78, Aarhus University (1977).

[14] Y. Métivier, Une condition suffisante de reconnaissabilité dans un monoïde partiellement commutatif. Theoret. Informatics Appl. 20 (1986) 121-127. | Numdam | MR | Zbl

[15] E. Ochmański, Regular behaviour of concurrent Systems. Bull. EUT. ASSOC. Theoret. Comput. Sci. EATCS 27 (1985) 56-67.

[16] E. Ochmański and P. A. Wacrenier, On regular compatibility of semi-commutations, in Proc. 20th International Colloquium on Automata, Languages and Programming (ICALP'93), edited by A. Lingas, R. Karlsson and S. Carlsson. Springer, Lecture Notes in Comput. Sci. 700 (1993) 445-456. | MR

[17] W. Zielonka, Notes on finite asynchronous automata. Theoret. Informatics Appl. 21 (1987) 99-135. | Numdam | MR | Zbl