Question: Prove that the following languages are not regular using the pumping lemma. B = {w#w2# ... #wk for k > 0w; 0* for every i
Prove that the following languages are not regular using the pumping lemma.

B = {w#w2# ... #wk for k > 0w; 0* for every i and w; # w; for every i # j} For example, 0#000#00 E B and 0#000#0 B. Hint: choose a string s E B that contains p #'s and p + 1 substrings Wi 0*
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
