Theoretical Computer Science - Special issue on universal machines and computations
Handbook of formal languages, vol. 1: word, language, grammar
Handbook of formal languages, vol. 1: word, language, grammar
Handbook of formal languages, vol. 1
Shuffle on trajectories: syntactic constraints
Theoretical Computer Science
Discrete Applied Mathematics
Reconstructing a history of recombinations from a set of sequences
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Varieties Of Formal Languages
Shuffle on Trajectories: The Schützenberger Product and Related Operations
MFCS '98 Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science
Hi-index | 0.00 |
We investigate the problem of finding monoids that recognize languages of the form L$_1$⋈$_T$L$_2$ where T is an arbitrary set of routes. We present a uniform method based on routes to find such monoids. Many classical operations from the theory of formal languages, such as catenation, bi-catenation, simple splicing, shuffle, literal shuffle, and insertion are shown to be just particular instances of the operation ⋈$_T$.