Complete subgraphs of bipartite graphs and applications to trace languages

G. Guaiana; A. Restivo; S. Salemi

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications (1990)

  • Volume: 24, Issue: 4, page 409-417
  • ISSN: 0988-3754

How to cite

top

Guaiana, G., Restivo, A., and Salemi, S.. "Complete subgraphs of bipartite graphs and applications to trace languages." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 24.4 (1990): 409-417. <http://eudml.org/doc/92365>.

@article{Guaiana1990,
author = {Guaiana, G., Restivo, A., Salemi, S.},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
keywords = {concurrency; trace languages},
language = {eng},
number = {4},
pages = {409-417},
publisher = {EDP-Sciences},
title = {Complete subgraphs of bipartite graphs and applications to trace languages},
url = {http://eudml.org/doc/92365},
volume = {24},
year = {1990},
}

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
PB - EDP-Sciences
VL - 24
IS - 4
SP - 409
EP - 417
LA - eng
KW - concurrency; trace languages
UR - http://eudml.org/doc/92365
ER -

References

top
  1. [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. Zbl0612.68071MR860763
  2. [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. Zbl0486.68079MR675445
  3. [3] P. CARTIER and D. FOATA, Problèmes combinatoires de commutation et réarrangements, Lecture Notes in Mathematics, Vol. 85, 1981. Zbl0186.30101
  4. [4] R. CORI and Y. METIVIER, Recognizable Subsets of Some Partially Abelian Monoids, Theoretical Computer Science, Vol. 35, 1985, pp. 179-189. Zbl0559.20040MR785150
  5. [5] R. CORI and D. PERRIN, Automates et commutations partielles, RAIRO Informatique Théorique, 19, 1985, pp. 21-32. Zbl0601.68055MR795769
  6. [6] J. E. HOPCROFT and J. D. ULLMAN, Introduction to Automata Theory, Languages and Computation, Addison-Wesley, 1979. Zbl0426.68001MR645539
  7. [7] A. MAZURKIEWICZ, Concurrent Program Schemes and Their Interpretations, DAIMI Rep. PB-78, Aarhus Univ., Aarhus, 1977. 
  8. [8] A. MAZURKIEWICZ, Traces, Histories, Graphs: Instances of a Process Monoid, Lecture Notes in Computer Science, Vol. 176, 1984, pp. 115-133. Zbl0577.68061MR783441
  9. [9] D. PERRIN, Words Over a Partially Commutative Alphabet, NATO ASI Series F12, 1985, pp. 329-340. Zbl0602.68070MR815350
  10. [10] J. SAKAROVITCH, On Regular Trace Languages, Theoretical Computer Science, Vol. 52, 1987, pp. 59-75. Zbl0634.68076MR918113

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.