A note on the commutative closure of star-free languages
- 29 January 1996
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 57 (2) , 71-74
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- New Results on the Star Problem in Trace MonoidsInformation and Computation, 1995
- Star-free trace languagesTheoretical Computer Science, 1992
- On finite monoids having only trivial subgroupsInformation and Control, 1965