On recognizable subsets of free partially commutative monoids
- 30 June 1988
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 58 (1-3) , 201-208
- https://doi.org/10.1016/0304-3975(88)90027-8
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Une condition suffisante de reconnaissabilité dans un monoïde partiellement commutatifRAIRO - Theoretical Informatics and Applications, 1986
- 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
- Regular Expressions and State Graphs for AutomataIEEE Transactions on Electronic Computers, 1960