shuffle (443B)
1 # Shuffle 2 3 A [word] w is a *shuffle* of two [words] u and v if we can interleave the characters of u and v to form w. We can also define the *shuffle* of two [formal_languages] L and L' as the set of [words] w that are shuffles of a [word] of L and a [word] of L' 4 5 - [shuffle_square] 6 - a finite set of [words] can be decomposed into at most one multiset of which it is the shuffle: 7 - see [berstel2002shuffle] 8 9 Up: [formal_language_operator]