Consider the following language over {a,b}L = { w | w=st, |s|=|t| and s does not exactly equal to t }Consider w = xyz, It is easy to use pumping lemma if |y| is odd.For |y| even, I have tried strings like $(ba)^pb(ab)^Pa$ but it doesnot work.Any ideas on how to do the proof?Thanks
Use Pumping Lemma to Prove Non-regularity
automata;regular languages;pumping lemma