Nesting of shuffle closure is important
- 26 July 1987
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 25 (6) , 363-367
- https://doi.org/10.1016/0020-0190(87)90213-4
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Extending regular expressions with iterated shuffleTheoretical Computer Science, 1985
- On the enlargement of the class of regular languages by the shuffle closureInformation Processing Letters, 1983
- Shuffle languages, Petri nets, and context-sensitive grammarsCommunications of the ACM, 1981
- Relations of flow languages to Petri net languagesTheoretical Computer Science, 1981