On the enlargement of the class of regular languages by the shuffle closure
- 26 February 1983
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 16 (2) , 51-54
- https://doi.org/10.1016/0020-0190(83)90023-6
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Flow languages equal recursively enumerable languagesActa Informatica, 1981
- Vector addition systems and regular languagesJournal of Computer and System Sciences, 1980
- Software Descriptions with Flow ExpressionsIEEE Transactions on Software Engineering, 1978
- Parallel program schemataJournal of Computer and System Sciences, 1969