prove that language is non regular trailing


Prove that Language is non regular
TRailing count={aa ba aaaa abaa baaa bbaa aaaaaa aabaaa abaaaa.....
1) Pumping Lemma
2)Myhill nerode

Request for Solution File

Ask an Expert for Answer!!
Theory of Computation: prove that language is non regular trailing
Reference No:- TGS0374605

Expected delivery within 24 Hours