Semantic shuffle on and deletion along trajectories

Abstract

We introduce semantic shuffle on trajectories (SST) and semantic deletion along trajectories (SDT). These operations generalize the notion of shuffle on trajectories, but add sufficient power to encompass various formal language operations used in applied areas. However, the added power given to SST and SDT does not destroy many desirable properties of shuffle on trajectories, especially with respect to solving language equations involving SST. We also investigate closure properties and decidability questions related to SST and SDT. © Springer-Verlag Berlin Heidelberg 2004.