Notes on finite asynchronous automata

 Access to full text

 Full (PDF)

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. Zbl0468.68081
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. Zbl0512.68056
3. 3. P. CARTIER and D. FOATA, Problèmes combinatoires de commutation et réarrangements, Lecture Notes in Math., Vol 85, 1969, Springer-Verlag. Zbl0186.30101MR239978
4. 4. M. CLERBOUT and M. LATTEUX, Partial Commutations and Faithful Rational Transductions, Theoretical Comp. Science, Vol. 34, 1984, pp. 241-254. Zbl0548.68073MR773455
5. 5. R. CORI and Y. METIVIER, Recognizable Subsets of Partially Abelian Monoids, Theoretical Comp. Science, Vol. 35, 1985, pp. 179-189. Zbl0559.20040MR785150
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. MR795769
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. 
8. 8. C. DUBOC, Mixed Product and Asynchronous Automata (submitted for publication). Zbl0638.68095
9. 9. S. EILENBERG, Automata, Languages and Machines, Vol. A, 1974, Academic Press. Zbl0317.94045MR530382
10. 10. R. JANICKI, Synthesis of Concurrent Schemes, Lecture Notes in Comp. Sc., Vol. 64, 1978, Springer Verlag, pp. 298-307. Zbl0382.68023MR519848
11. 11. G. LALLEMENT, Semigroups and Combinatorial Applications, 1979, J. Wiley and Sons, New York. Zbl0421.20025MR530552
12. 12. A. MAZURKIEWICZ, Concurrent Program Schemes and Their Interpretations, DAIMI-PB-78, Aarhus University, 1977. 
13. 13. E. OCHMAŃSKI, Regular Behaviour of Concurrent Schemes, E.A.T.C.S. Bulletin, No. 27, October 1985, pp. 56-67. 
14. 14. W. REISIG, Petrinetze. Eine Einführung, 1982, Springer Verlag. Zbl0482.68054MR694697
15. 15. M. W. SHIELDS, Non-Sequential Behaviour : 1, Report CSR-120-82, Department of Comp. Science, University of Edinburgh, 1982. 
16. 16. P. H. STARKE, Free Petri Net Languages, Lecture Notes in Comp. Sc., Vol. 64, Springer Verlag, pp. 506-515. Zbl0391.68038MR519867
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. 

1. Benedek Nagy, Friedrich Otto, CD-systems of stateless deterministic R(1)-automata governed by an external pushdown store
2. Mireille Clerbout, Compositions de fonctions de commutation partielle
3. Benedek Nagy, Friedrich Otto, CD-systems of stateless deterministic R(1)-automata governed by an external pushdown store
4. M. Clerbout, Y. Roos, I. Ryl, Semi-commutations and partial commutations
5. A. Arnold, An extension of the notions of traces and of asynchronous automata