Free Access
RAIRO-Theor. Inf. Appl.
Volume 23, Number 4, 1989
Page(s) 395 - 424
Published online 01 February 2017
  1. 1. I. J. AALBERSBERG et G. ROZENBER, Theory of traces, rep n° 85-16, University of Leiden. [MR: 947532] [Google Scholar]
  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. [MR: 675445] [Zbl: 0486.68079] [Google Scholar]
  3. 3. P. CARTIER et D. FOATA, Problèmes Combinatoires de Commutation et réarrangements, Lectures Notes in Math., vol. 85, Springer Verlag, 1969. [MR: 239978] [Zbl: 0186.30101] [Google Scholar]
  4. 4. M. CLERBOUT, Commutations partielles et familles de langages, Thèse de 3e cycle, Lille, 1984. [Google Scholar]
  5. 5. M. CLERBOUT et M. LAITEUX, Semi-Commutations, Information and Computation, n° 73, p. 15-24, 1987. [Zbl: 0593.68058] [Google Scholar]
  6. 6. R. CORI et Y. METIVIER, Recognizable Subsets of some partially abelian monoïds, Theoretical Computer Sciences, vol. 35, 1985, p. 179-189. [MR: 785150] [Zbl: 0559.20040] [Google Scholar]
  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. [MR: 795769] [Google Scholar]
  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. [Google Scholar]
  9. 9. M. P. FLÉ et G. ROUCAIROL, Maximal serializability of iterated transactions, Theoretical Computer Science, vol. 38, 1985, p. 1-16. [MR: 805130] [Zbl: 0572.68082] [Google Scholar]
  10. 10. A. MAZURKIEWICZ, Concurrent program schemes and their interpretations, D.A.I.M.I., PB 78, Aarhus University, 1977. [Google Scholar]
  11. 11. E. OCHMANSKI, Regular Behaviour of concurrent Systems, E.A.T.C.S. Bulletin, octobre 1985. [Google Scholar]
  12. 12. D. PERRIN, Words over a partially commutative alphabet, Rapport L.I.T.P., n° 84-59. [Zbl: 0602.68070] [Google Scholar]
  13. 13. W. ZIELONKA, Notes on Finite Asynchronous Automata, R.A.I.R.O. Info. Théorique, n° 21, p. 99-135, 1987. [EuDML: 92285] [MR: 894706] [Zbl: 0623.68055] [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.