Sign Up
Prove that the language L = {an ; n is a perfect square}is not a regular language by pumping lemma.