Question

Using pumping lemma for CFL's, show
that the language L = {aP\p is a prime
number} is not a CFL. Write down
an algorithm to verify if a CFL is finite
or infinite.​

Answer 1

Answer:

this is very tough