We generalise its notion of balancedness to allow parentheses of different types to freely commute. We show that balanced regular and ω-regular languages can be characterised by syntactic constraints on regular and ω-regular expressions and, using the shuffle on trajectories operator, we define ...