Shuffle Operations on Euler Graphs

Abstract

The shuffle operation on strings is a fundamental operation, well studied in the theory of formal languages.  Shuffle on trajectories yields a flexible method to handle the shuffle operation on two strings.  In this paper, the shuffle on trajectories is extended to the string representations of Euler graphs and interesting results are obtained. Some algebraic properties such as completeness, determinism and commutativity of the trajectories involved in this study are provided.