no. 4
Complete subgraphs of bipartite graphs and applications to trace languages
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 24 (1990) no. 4, pp. 409-417. 
@article{ITA_1990__24_4_409_0,
     author = {Guaiana, G. and Restivo, A. and Salemi, S.},
     title = {Complete subgraphs of bipartite graphs and applications to trace languages},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     pages = {409--417},
     publisher = {EDP-Sciences},
     volume = {24},
     number = {4},
     year = {1990},
     mrnumber = {1079722},
     zbl = {0701.68063},
     language = {en},
     url = {http://www.numdam.org/item/ITA_1990__24_4_409_0/}
}
TY  - JOUR
AU  - Guaiana, G.
AU  - Restivo, A.
AU  - Salemi, S.
TI  - Complete subgraphs of bipartite graphs and applications to trace languages
JO  - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY  - 1990
SP  - 409
EP  - 417
VL  - 24
IS  - 4
PB  - EDP-Sciences
UR  - http://www.numdam.org/item/ITA_1990__24_4_409_0/
LA  - en
ID  - ITA_1990__24_4_409_0
ER  - 
%0 Journal Article
%A Guaiana, G.
%A Restivo, A.
%A Salemi, S.
%T Complete subgraphs of bipartite graphs and applications to trace languages
%J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
%D 1990
%P 409-417
%V 24
%N 4
%I EDP-Sciences
%U http://www.numdam.org/item/ITA_1990__24_4_409_0/
%G en
%F ITA_1990__24_4_409_0
Guaiana, G.; Restivo, A.; Salemi, S. Complete subgraphs of bipartite graphs and applications to trace languages. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 24 (1990) no. 4, pp. 409-417. http://www.numdam.org/item/ITA_1990__24_4_409_0/

[1] Ij. J. Aalbersberg and G. Rozenberg, Trace Languages Defined by Regular String Languages, RAIRO Informatique Théorique et Applications, Vol. 20, 1986, pp. 103-119. | Numdam | MR | Zbl

[2] A. Bertoni, G. Mauri and N. Sabatini, Equivalence and Membership Problems for Regular Trace Languages, Lecture Notes in Computer Science, Vol. 140, 1982, pp. 61-71. | MR | Zbl

[3] P. Cartier and D. Foata, Problèmes combinatoires de commutation et réarrangements, Lecture Notes in Mathematics, Vol. 85, 1981.

[4] R. Cori and Y. Metivier, Recognizable Subsets of Some Partially Abelian Monoids, Theoretical Computer Science, Vol. 35, 1985, pp. 179-189. | MR | Zbl

[5] R. Cori and D. Perrin, Automates et commutations partielles, RAIRO Informatique Théorique, 19, 1985, pp. 21-32. | Numdam | MR | Zbl

[6] J. E. Hopcroft and J. D. Ullman, Introduction to Automata Theory, Languages and Computation, Addison-Wesley, 1979. | MR | Zbl

[7] A. Mazurkiewicz, Concurrent Program Schemes and Their Interpretations, DAIMI Rep. PB-78, Aarhus Univ., Aarhus, 1977.

[8] A. Mazurkiewicz, Traces, Histories, Graphs: Instances of a Process Monoid, Lecture Notes in Computer Science, Vol. 176, 1984, pp. 115-133. | MR | Zbl

[9] D. Perrin, Words Over a Partially Commutative Alphabet, NATO ASI Series F12, 1985, pp. 329-340. | MR | Zbl

[10] J. Sakarovitch, On Regular Trace Languages, Theoretical Computer Science, Vol. 52, 1987, pp. 59-75. | MR | Zbl