On recognizable subsets of free partially commutative monoids
- 1 January 1986
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 254-264
- https://doi.org/10.1007/3-540-16761-7_75
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- 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
- Words over a Partially Commutative AlphabetPublished by Springer Nature ,1985
- Equivalence and membership problems for regular trace languagesPublished by Springer Nature ,1982
- Transductions and Context-Free LanguagesPublished by Springer Nature ,1979
- Regular Expressions and State Graphs for AutomataIEEE Transactions on Electronic Computers, 1960