1 problem
Matching
Let an -word be a word of length over an -letter alphabet, and suppose it has a unique factorisation into factors corresponding to alphabet-disjoint partitions. A w…
Let an -word be a word of length over an -letter alphabet, and suppose it has a unique factorisation into factors corresponding to alphabet-disjoint partitions. A w…