Recognizable closures and submonoids of free partially commutative monoids
- 2 September 1991
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 86 (2) , 233-241
- https://doi.org/10.1016/0304-3975(91)90019-x
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- On recognizable subsets of free partially commutative monoidsTheoretical Computer Science, 1988
- Notes on finite asynchronous automataRAIRO - Theoretical Informatics and Applications, 1987
- On the decidability of some problems about rational subsets of free partially commutative monoidsTheoretical Computer Science, 1986
- On some equations in free partially commutative monoidsTheoretical Computer Science, 1986
- Une condition suffisante de reconnaissabilité dans un monoïde partiellement commutatifRAIRO - Theoretical Informatics and Applications, 1986
- Recognizable subsets of some partially abelian monoidsTheoretical Computer Science, 1985
- Automates et commutations partiellesRAIRO. Informatique théorique, 1985
- On serializability of iterated transactionsPublished by Association for Computing Machinery (ACM) ,1982