Notes on finite asynchronous automata
Zielonka, Wieslaw
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 21 (1987), p. 99-135 / Harvested from Numdam
Access to full text
Full (PDF)
Full (DJVU) 
@article{ITA_1987__21_2_99_0,
     author = {Zielonka, Wieslaw},
     title = {Notes on finite asynchronous automata},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     volume = {21},
     year = {1987},
     pages = {99-135},
     mrnumber = {894706},
     zbl = {0623.68055},
     language = {en},
     url = {http://dml.mathdoc.fr/item/ITA_1987__21_2_99_0}
}

Zielonka, Wieslaw. Notes on finite asynchronous automata. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 21 (1987) pp. 99-135. http://gdmltest.u-ga.fr/item/ITA_1987__21_2_99_0/

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

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

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

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

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

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. | Numdam | MR 795769

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. C. Duboc, Mixed Product and Asynchronous Automata (submitted for publication). | Zbl 0638.68095

9. S. Eilenberg, Automata, Languages and Machines, Vol. A, 1974, Academic Press. | MR 530382 | Zbl 0317.94045

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

11. G. Lallement, Semigroups and Combinatorial Applications, 1979, J. Wiley and Sons, New York. | MR 530552 | Zbl 0421.20025

12. A. Mazurkiewicz, Concurrent Program Schemes and Their Interpretations, DAIMI-PB-78, Aarhus University, 1977.

13. E. Ochmański, Regular Behaviour of Concurrent Schemes, E.A.T.C.S. Bulletin, No. 27, October 1985, pp. 56-67.

14. W. Reisig, Petrinetze. Eine Einführung, 1982, Springer Verlag. | MR 694697 | Zbl 0482.68054

15. M. W. Shields, Non-Sequential Behaviour : 1, Report CSR-120-82, Department of Comp. Science, University of Edinburgh, 1982.

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

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.