Let = {1, #} and

In other words, Y is the set of all strings that have zero or more substrings that consists of 1s separated by #. However, the sequences of 1s cannot be of the same length. For instance, # L2 and 1# L2, but 1#11#1# L2. If Y is regular, build the corresponding FA that accepts the languages. If not, demonstrate that by using the pumping lemma proof.

w = x 1#x #x# where k 20, X'E 1., and if i j then xi Xi