Aspects of shuffle and deletion on trajectories

We begin with the study of algebraic properties of the deletion on trajectories. Then we focus on three standard decision problems concerning linear language equations with one variable, involving the above mentioned operations. We generalize previous results and obtain a sequence of new ones. Particularly, we characterize the class of binary word operations for which the validity of such a language equation is (un)decidable, for regular and context-free operands.