The Shuffle on Trajectories of Infinite Arrays
Devi Velayutham
Department of Mathematics, Hindustan College of Arts and
Science, India
Abstract: In this paper authors study and investigate the shuffle on
trajectories on infinite array languages. Like finite array languages this
approach is applicable to concurrency providing a method to define parallel
composition of processes. It is also applicable to parallel computation. The
operations are introduced using a uniform method based on the notion of ww-trajectory. Authors introduce an Array Grammar
with Shuffle on Trajectories (AGST) and compare it with other array grammars
for generative poauthorsr. Authors prove closure properties for different
classes of array languages with respect to the shuffle on trajectories.
Keywords: Büchi two-dimensional online
tessellation automaton, ww-trajectory, ww-recognizable array language, column
shuffle ww-recognizable array language.
