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