2-Asynchronous automata
- 31 October 1988
- journal article
- research article
- Published by Elsevier in Theoretical Computer Science
- Vol. 61 (1) , 93-102
- https://doi.org/10.1016/0304-3975(88)90110-7
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Notes on finite asynchronous automataRAIRO - Theoretical Informatics and Applications, 1987
- Maximal serializability of iterated transactionsTheoretical Computer Science, 1985
- Recognizable subsets of some partially abelian monoidsTheoretical Computer Science, 1985
- Automates et commutations partiellesRAIRO. Informatique théorique, 1985