In: Computer Science
Prove that the following language are NOT regular using the pumping lemma
(20 pt.) ? = {? ∈ {?, #}∗ | ? = ??#??# ... #?? ??? ? ≥ ?, ?? ∈
?∗ ??? ????? ?, ??? ?? ≠?? ???????? ?≠?}
Hint: choose a string ? ∈ ? that contains ? #’s.