论文信息 - Shuffle factorization is unique

Shuffle factorization is unique

We prove that, given a finite set of words S, there exists at most one (normalized) multiset P such that S is the shuffle of the words in P. The multiset P is effectively computable.

Jean Berstel | Luc Boasson | J. Berstel | L. Boasson

[1] David E. Radford,et al. A natural ring basis for the shuffle algebra and an application to group schemes , 1979 .

[2] C. Pandu Rangan,et al. Efficient Parallel Shuffle Recognition , 1994, Parallel Process. Lett..

[3] C. Siva Ram Murthy,et al. A constant time string shuffle algorithm on reconfigurable meshes , 1998, Int. J. Comput. Math..

[4] J C Spehner. Rapid calculation of shuffles of two words , 1986 .