Extending regular expressions with iterated shuffle
- 1 January 1985
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 38, 223-247
- https://doi.org/10.1016/0304-3975(85)90221-x
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- On the enlargement of the class of regular languages by the shuffle closureInformation Processing Letters, 1983
- The power of synchronizing operations on stringsTheoretical Computer Science, 1981
- Shuffle languages, Petri nets, and context-sensitive grammarsCommunications of the ACM, 1981
- Flow languages equal recursively enumerable languagesActa Informatica, 1981
- Relations of flow languages to Petri net languagesTheoretical Computer Science, 1981
- Very special languages and representations of recursively enumerable languages via computation historiesInformation and Control, 1980
- Parallel system schemas and their relation to automataInformation Processing Letters, 1980
- On the hierarchy of Petri net languagesRAIRO. Informatique théorique, 1979
- Remarks on blind and partially blind one-way multicounter machinesTheoretical Computer Science, 1978
- Rational sets in commutative monoidsJournal of Algebra, 1969