Vol. 10 No. 1 (2011): Mapana Journal of Sciences
Research Articles

Shuffle Operations on Euler Graphs

  • Meenakshi Paramasivan,
  • N.G. David
Meenakshi Paramasivan
Department of Mathematics, Madras Christian College, Chennai 600 059
N.G. David
Department of Mathematics, Madras Christian College, Chennai 600 059
DOI: https://doi.org/10.12723/mjs.18.6

Published 2021-08-26

Copyright (c) 2011

Creative Commons License

This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

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.

References

  1. A. Mateescu, G. Rozenberg and A. Salomaa, Shuffle on trajectories: syntactic constraints, Theoretical Computer Science 197 (1998) 1-56.
  2. L. Jeganathan, K. Krithivasan and R. Rama, Graph Splicing System, in the proceedings of International Conference on Theoretical and Mathematical Foundation of Computer Science, (2008) 72-79.