{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T08:45:00Z","timestamp":1780994700616,"version":"3.54.1"},"reference-count":17,"publisher":"EDP Sciences","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Theor. Inf. Appl."],"published-print":{"date-parts":[[1987]]},"DOI":"10.1051\/ita\/1987210200991","type":"journal-article","created":{"date-parts":[[2017,2,2]],"date-time":"2017-02-02T10:07:59Z","timestamp":1486030079000},"page":"99-135","source":"Crossref","is-referenced-by-count":175,"title":["Notes on finite asynchronous automata"],"prefix":"10.1051","volume":"21","author":[{"given":"Wieslaw","family":"Zielonka","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"250","published-online":{"date-parts":[[2011,1,8]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","unstructured":"1. BERTONI A., BRAMBILLA M., MAURI G. and SABADINI N., 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.0468.68081","DOI":"10.1007\/3-540-10856-4_86"},{"key":"R2","unstructured":"2. BERTONI A., MAURI G. and SABADINI N., A Hierarchy of Regular Trace Languages and Some Combinatorial Applications, 2nd World Conf. on Mathematics at the Service of Men, Las Palmas, 1982.0512.68056"},{"key":"R3","doi-asserted-by":"crossref","unstructured":"3. CARTIER P. and FOATA D., Probl\u00e8mes combinatoires de commutation et r\u00e9arrangements, Lecture Notes in Math., Vol 85, 1969, Springer-Verlag.2399780186.30101","DOI":"10.1007\/BFb0079468"},{"key":"R4","doi-asserted-by":"crossref","unstructured":"4. CLERBOUT M. and LATTEUX M., Partial Commutations and Faithful Rational Transductions, Theoretical Comp. Science, Vol. 34, 1984, pp. 241-254.7734550548.68073","DOI":"10.1016\/0304-3975(84)90053-7"},{"key":"R5","doi-asserted-by":"crossref","unstructured":"5. CORI R. and METIVIER Y., Recognizable Subsets of Partially Abelian Monoids, Theoretical Comp. Science, Vol. 35, 1985, pp. 179-189.7851500559.20040","DOI":"10.1016\/0304-3975(85)90013-1"},{"key":"R6","doi-asserted-by":"crossref","unstructured":"6. CORI R. and PERRIN D., Sur la reconnaissabilit\u00e9 dans les mono\u00efdes partiellement commutatifs libres, R.A.I.R.O. Inform. Th\u00e9or., Vol. 19, 1985, pp. 21-32.92219795769","DOI":"10.1051\/ita\/1985190100211"},{"key":"R7","unstructured":"7. DUBOC C., Commutations dans les mono\u00efdes libres : un cadre th\u00e9oretique pour l'\u00e9tude du parall\u00e9lisme, Th\u00e8se de 3e cycle, also Technical Report 86-25, Laboratoire Informatique Th\u00e9oretique et Programmation, 1986."},{"key":"R8","unstructured":"8. DUBOC C., Mixed Product and Asynchronous Automata (submitted for publication).0638.68095"},{"key":"R9","unstructured":"9. EILENBERG S., Automata, Languages and Machines, Vol. A, 1974, Academic Press.5303820317.94045"},{"key":"R10","doi-asserted-by":"crossref","unstructured":"10. JANICKI R., Synthesis of Concurrent Schemes, Lecture Notes in Comp. Sc., Vol. 64, 1978, Springer Verlag, pp. 298-307.5198480382.68023","DOI":"10.1007\/3-540-08921-7_77"},{"key":"R11","unstructured":"11. LALLEMENT G., Semigroups and Combinatorial Applications, 1979, J. Wiley and Sons, New York.5305520421.20025"},{"key":"R12","doi-asserted-by":"crossref","unstructured":"12. MAZURKIEWICZ A., Concurrent Program Schemes and Their Interpretations, DAIMI-PB-78, Aarhus University, 1977.","DOI":"10.7146\/dpb.v6i78.7691"},{"key":"R13","unstructured":"13. OCHMA\u0143SKI E., Regular Behaviour of Concurrent Schemes, E.A.T.C.S. Bulletin, No. 27, October 1985, pp. 56-67."},{"key":"R14","doi-asserted-by":"crossref","unstructured":"14. REISIG W., Petrinetze. Eine Einf\u00fchrung, 1982, Springer Verlag.6946970482.68054","DOI":"10.1007\/978-3-642-96705-4"},{"key":"R15","unstructured":"15. SHIELDS M. W., Non-Sequential Behaviour : 1, Report CSR-120-82, Department of Comp. Science, University of Edinburgh, 1982."},{"key":"R16","doi-asserted-by":"crossref","unstructured":"16. STARKE P. H., Free Petri Net Languages, Lecture Notes in Comp. Sc., Vol. 64, Springer Verlag, pp. 506-515.5198670391.68038","DOI":"10.1007\/3-540-08921-7_99"},{"key":"R17","unstructured":"17. TARLECKI A., Notes on the Implementability of Formal Languages by Concurrent Systems, Institute of Computer Science of Polish Academy of Sciences, Report 481, Warsaw, 1982."}],"container-title":["RAIRO - Theoretical Informatics and Applications"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/1987210200991\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,18]],"date-time":"2019-09-18T01:59:03Z","timestamp":1568771943000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/1987210200991"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987]]},"references-count":17,"journal-issue":{"issue":"2"},"alternative-id":["ita1987210200991"],"URL":"https:\/\/doi.org\/10.1051\/ita\/1987210200991","relation":{},"ISSN":["0988-3754","1290-385X"],"issn-type":[{"value":"0988-3754","type":"print"},{"value":"1290-385X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1987]]}}}