0000 Example: L={a^p, p is not prime} | MyCareerwise

FOR FREE CONTENT

Example:

 

 

Prove that the language L = {ap, p is not prime} is not a regular language by pumping lemma.