retagged by
1,326 views

3 Answers

Best answer
3 votes
3 votes

No, $ L = \{ a^{mn} | m , n \in P \} $, P is set of Prime numbers,  is not context free. 

Even  $ L = \{ a^{p} | p \in prime \} $ is not context free. 

You can prove it by using Pumping lemma

selected by
0 votes
0 votes
It is not CFL because we can't compare in case of CFL.We need comparison to check a prime no.

So it is CSL.
0 votes
0 votes
Although such type of questioned can only be checked through Pumping Lemma but still we can guess.

like

1) calculations like multiplication , division make a language CSL (prime number for example).

2) Non linear power make a language CSL(like perfect square ,  perfect cube).

Related questions