1 paper
Jeremy Nicholson, Narad Rampersad
We characterize the finite sets S of words such that that the iterated shuffle of S is co-finite and we give some bounds on the length of a longest word not in the iterated shuffle…