@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}, pages = {99--135}, publisher = {EDP-Sciences}, volume = {21}, number = {2}, year = {1987}, mrnumber = {894706}, zbl = {0623.68055}, language = {en}, url = {http://archive.numdam.org/item/ITA_1987__21_2_99_0/} }
TY - JOUR AU - Zielonka, Wieslaw TI - Notes on finite asynchronous automata JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications PY - 1987 SP - 99 EP - 135 VL - 21 IS - 2 PB - EDP-Sciences UR - http://archive.numdam.org/item/ITA_1987__21_2_99_0/ LA - en ID - ITA_1987__21_2_99_0 ER -
%0 Journal Article %A Zielonka, Wieslaw %T Notes on finite asynchronous automata %J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications %D 1987 %P 99-135 %V 21 %N 2 %I EDP-Sciences %U http://archive.numdam.org/item/ITA_1987__21_2_99_0/ %G en %F 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) no. 2, pp. 99-135. http://archive.numdam.org/item/ITA_1987__21_2_99_0/
1. 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
, , and ,2. A Hierarchy of Regular Trace Languages and Some Combinatorial Applications, 2nd World Conf. on Mathematics at the Service of Men, Las Palmas, 1982. | Zbl
, and ,3. Problèmes combinatoires de commutation et réarrangements, Lecture Notes in Math., Vol 85, 1969, Springer-Verlag. | MR | Zbl
and ,4. Partial Commutations and Faithful Rational Transductions, Theoretical Comp. Science, Vol. 34, 1984, pp. 241-254. | MR | Zbl
and ,5. Recognizable Subsets of Partially Abelian Monoids, Theoretical Comp. Science, Vol. 35, 1985, pp. 179-189. | MR | Zbl
and ,6. 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
and ,7. 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. Mixed Product and Asynchronous Automata (submitted for publication). | Zbl
,9. Automata, Languages and Machines, Vol. A, 1974, Academic Press. | MR | Zbl
,10. Synthesis of Concurrent Schemes, Lecture Notes in Comp. Sc., Vol. 64, 1978, Springer Verlag, pp. 298-307. | MR | Zbl
,11. Semigroups and Combinatorial Applications, 1979, J. Wiley and Sons, New York. | MR | Zbl
,12. Concurrent Program Schemes and Their Interpretations, DAIMI-PB-78, Aarhus University, 1977.
,13. Regular Behaviour of Concurrent Schemes, E.A.T.C.S. Bulletin, No. 27, October 1985, pp. 56-67.
,14. Petrinetze. Eine Einführung, 1982, Springer Verlag. | MR | Zbl
,15. Non-Sequential Behaviour : 1, Report CSR-120-82, Department of Comp. Science, University of Edinburgh, 1982.
,16. Free Petri Net Languages, Lecture Notes in Comp. Sc., Vol. 64, Springer Verlag, pp. 506-515. | MR | Zbl
,17. Notes on the Implementability of Formal Languages by Concurrent Systems, Institute of Computer Science of Polish Academy of Sciences, Report 481, Warsaw, 1982.
,