Compositions de fonctions de commutation partielle

Mireille Clerbout

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

  • Volume: 23, Issue: 4, page 395-424
  • ISSN: 0988-3754

How to cite

top

Clerbout, Mireille. "Compositions de fonctions de commutation partielle." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 23.4 (1989): 395-424. <http://eudml.org/doc/92341>.

@article{Clerbout1989,
author = {Clerbout, Mireille},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
keywords = {partially commutative alphabet},
language = {fre},
number = {4},
pages = {395-424},
publisher = {EDP-Sciences},
title = {Compositions de fonctions de commutation partielle},
url = {http://eudml.org/doc/92341},
volume = {23},
year = {1989},
}

TY - JOUR
AU - Clerbout, Mireille
TI - Compositions de fonctions de commutation partielle
JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY - 1989
PB - EDP-Sciences
VL - 23
IS - 4
SP - 395
EP - 424
LA - fre
KW - partially commutative alphabet
UR - http://eudml.org/doc/92341
ER -

References

top
  1. 1. I. J. AALBERSBERG et G. ROZENBER, Theory of traces, rep n° 85-16, University of Leiden. MR947532
  2. 2. A. BERTONI, G. MAURI et N. SABADINI, Equivalence and membership problems for regular trace languages, 9e I.C.A.L.P., Aarhus, Lecture Note in Computer Science, vol. 140, 1982, p. 61-71. Zbl0486.68079MR675445
  3. 3. P. CARTIER et D. FOATA, Problèmes Combinatoires de Commutation et réarrangements, Lectures Notes in Math., vol. 85, Springer Verlag, 1969. Zbl0186.30101MR239978
  4. 4. M. CLERBOUT, Commutations partielles et familles de langages, Thèse de 3e cycle, Lille, 1984. 
  5. 5. M. CLERBOUT et M. LAITEUX, Semi-Commutations, Information and Computation, n° 73, p. 15-24, 1987. Zbl0593.68058
  6. 6. R. CORI et Y. METIVIER, Recognizable Subsets of some partially abelian monoïds, Theoretical Computer Sciences, vol. 35, 1985, p. 179-189. Zbl0559.20040MR785150
  7. 7. R. CORI et D. PERRIN, Sur la reconnaissabilité dans les monoïdes partiellement commutatifs libres, R.A.I.R.O. Informatique Théorique, vol. 19, 1985. MR795769
  8. 8. C. DUBOC, Commutations dans les monoïdes libres : un cadre théorique pour l'étude du parallélisme, Thèse 3e cycle, Rouen, 1986. 
  9. 9. M. P. FLÉ et G. ROUCAIROL, Maximal serializability of iterated transactions, Theoretical Computer Science, vol. 38, 1985, p. 1-16. Zbl0572.68082MR805130
  10. 10. A. MAZURKIEWICZ, Concurrent program schemes and their interpretations, D.A.I.M.I., PB 78, Aarhus University, 1977. 
  11. 11. E. OCHMANSKI, Regular Behaviour of concurrent Systems, E.A.T.C.S. Bulletin, octobre 1985. 
  12. 12. D. PERRIN, Words over a partially commutative alphabet, Rapport L.I.T.P., n° 84-59. Zbl0602.68070
  13. 13. W. ZIELONKA, Notes on Finite Asynchronous Automata, R.A.I.R.O. Info. Théorique, n° 21, p. 99-135, 1987. Zbl0623.68055MR894706

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.