Notes on finite asynchronous automata
Open Access
- 1 January 1987
- journal article
- research article
- Published by EDP Sciences in RAIRO - Theoretical Informatics and Applications
- Vol. 21 (2) , 99-135
- https://doi.org/10.1051/ita/1987210200991
Abstract
RAIRO - Theoretical Informatics and Applications, an international journal on theoretical computer science and its applicationsKeywords
This publication has 9 references indexed in Scilit:
- Recognizable subsets of some partially abelian monoidsTheoretical Computer Science, 1985
- Automates et commutations partiellesRAIRO. Informatique théorique, 1985
- Partial commutations and faithful rational transductionsTheoretical Computer Science, 1984
- PetrinetzePublished by Springer Nature ,1982
- An application of the theory of free partially commutative monoids: Asymptotic densities of trace languagesLecture Notes in Computer Science, 1981
- Free Petri net languagesLecture Notes in Computer Science, 1978
- Synthesis of concurrent schemesLecture Notes in Computer Science, 1978
- Concurrent Program Schemes and their InterpretationsDAIMI Report Series, 1977
- Problèmes combinatoires de commutation et réarrangementsLecture Notes in Mathematics, 1969