Suppose an! = xyz such that |y| ≥ 1 and xyiz is in the language for all i. Then n! < |xy2z| ≤ 2n! < (n + 1)! for n > 1.
Hi Guys, I am not sure if this is the right place to post this, so I am sorry if I did just disobey any forum rules.
The Problem is to show that=>
a^(n!) for all n>1 is not Regular. Using Pumping lemma. Can anyone please help me be get started?
If n be the Number of States, then if we take w= a^(n!) , Then|w|=n!>=n. Thats ok but How do I now Split w into x,y,z?
Thank you in Advance