Free Access
RAIRO-Theor. Inf. Appl.
Volume 21, Number 2, 1987
Page(s) 99 - 135
Published online 01 February 2017
  1. 1. A. BERTONI, M. BRAMBILLA, G. MAURI and N. SABADINI, An Application of the Theory of Tree Partially Commutative Monoids: Asymptotic Densities of Trace Languages, Lecture Notes in Comp. Sci., Vol. 117, 1981, Springer-Verlag, pp. 205-215. [Zbl: 0468.68081] [Google Scholar]
  2. 2. A. BERTONI, G. MAURI and N. SABADINI, A Hierarchy of Regular Trace Languages and Some Combinatorial Applications, 2nd World Conf. on Mathematics at the Service of Men, Las Palmas, 1982. [Zbl: 0512.68056] [Google Scholar]
  3. 3. P. CARTIER and D. FOATA, Problèmes combinatoires de commutation et réarrangements, Lecture Notes in Math., Vol 85, 1969, Springer-Verlag. [MR: 239978] [Zbl: 0186.30101] [Google Scholar]
  4. 4. M. CLERBOUT and M. LATTEUX, Partial Commutations and Faithful Rational Transductions, Theoretical Comp. Science, Vol. 34, 1984, pp. 241-254. [MR: 773455] [Zbl: 0548.68073] [Google Scholar]
  5. 5. R. CORI and Y. METIVIER, Recognizable Subsets of Partially Abelian Monoids, Theoretical Comp. Science, Vol. 35, 1985, pp. 179-189. [MR: 785150] [Zbl: 0559.20040] [Google Scholar]
  6. 6. R. CORI and D. PERRIN, Sur la reconnaissabilité dans les monoïdes partiellement commutatifs libres, R.A.I.R.O. Inform. Théor., Vol. 19, 1985, pp. 21-32. [EuDML: 92219] [MR: 795769] [Google Scholar]
  7. 7. C. DUBOC, Commutations dans les monoïdes libres : un cadre théoretique pour l'étude du parallélisme, Thèse de 3e cycle, also Technical Report 86-25, Laboratoire Informatique Théoretique et Programmation, 1986. [Google Scholar]
  8. 8. C. DUBOC, Mixed Product and Asynchronous Automata (submitted for publication). [Zbl: 0638.68095] [Google Scholar]
  9. 9. S. EILENBERG, Automata, Languages and Machines, Vol. A, 1974, Academic Press. [MR: 530382] [Zbl: 0317.94045] [Google Scholar]
  10. 10. R. JANICKI, Synthesis of Concurrent Schemes, Lecture Notes in Comp. Sc., Vol. 64, 1978, Springer Verlag, pp. 298-307. [MR: 519848] [Zbl: 0382.68023] [Google Scholar]
  11. 11. G. LALLEMENT, Semigroups and Combinatorial Applications, 1979, J. Wiley and Sons, New York. [MR: 530552] [Zbl: 0421.20025] [Google Scholar]
  12. 12. A. MAZURKIEWICZ, Concurrent Program Schemes and Their Interpretations, DAIMI-PB-78, Aarhus University, 1977. [Google Scholar]
  13. 13. E. OCHMAŃSKI, Regular Behaviour of Concurrent Schemes, E.A.T.C.S. Bulletin, No. 27, October 1985, pp. 56-67. [Google Scholar]
  14. 14. W. REISIG, Petrinetze. Eine Einführung, 1982, Springer Verlag. [MR: 694697] [Zbl: 0482.68054] [Google Scholar]
  15. 15. M. W. SHIELDS, Non-Sequential Behaviour : 1, Report CSR-120-82, Department of Comp. Science, University of Edinburgh, 1982. [Google Scholar]
  16. 16. P. H. STARKE, Free Petri Net Languages, Lecture Notes in Comp. Sc., Vol. 64, Springer Verlag, pp. 506-515. [MR: 519867] [Zbl: 0391.68038] [Google Scholar]
  17. 17. A. TARLECKI, Notes on the Implementability of Formal Languages by Concurrent Systems, Institute of Computer Science of Polish Academy of Sciences, Report 481, Warsaw, 1982. [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.