Abstract
We introduce the literal shuffle operation, that is, a more constrained form of the well-known shuffle operation. In order to describe concurrent processes, the shuffle operation models the asynchronous case, while the literal shuffle operation corresponds to a synchronous behaviour. The closure properties of some classical families of languages under literal shuffle are studied and properties of families of languages defined by the means of literal shuffle are given.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
