Abstract
We introduce a new operation between words and languages, called distributed catenation. The distributed catenation is a natural extension of the well-known catenation operation. As for partial shuffle operation the introduction of this operation is motivated by the theory of concurrency. At the same time the distributed catenation is a powerful operation. For instance, any Turing machine can be simulated by a pushdown automaton that uses distributed catenation for the pushdown memory.
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.
