Infinite hierarchy of expressions containing shuffle closure operator☆
References (6)
- et al.
Relations of flow languages to Petri net languages
Theoret. Comput. Sci.
(1981) Extending regular expressions with iterated shuffle
Theoret. Comput. Sci.
(1985)On the enlargement of the class of regular languages by shuffle closure
Inform. Process. Lett.
(1983)
There are more references available in the full text version of this article.
Cited by (3)
Infinite hierarchy of shuffle expressions over a finite alphabet
1990, Information Processing LettersA hierarchy of languages with catenation and shuffle
2013, Fundamenta InformaticaeAnalytic aspects of the shuffle product
2008, Proceedings of the 25th International Symposium on Theoretical Aspects of Computer Science, STACS 2008
- ☆
This work was partially supported by Grant No. RP.I.09
Copyright © 1988 Published by Elsevier B.V.