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 of S.
生成讲解博客的中文版本
生成AI智能校验的中文版本