204 views
0 votes
0 votes
Show that the following languages on $\Sigma = \{a,b,c\}$ are not context-free

                                                  $L = \{a^nb^m: \text{n and m are both prime}\}$.

Please log in or register to answer this question.

Related questions

397
views
0 answers
0 votes
Rishi yadav asked Apr 15, 2019
397 views
Show that the following languages on $\Sigma = \{a,b,c\}$ are not context-free $L = \{a^nb^m: \text{n is prime and m is not prime}\}$.
369
views
1 answers
0 votes
Rishi yadav asked Apr 15, 2019
369 views
Show that the following languages on $\Sigma = \{a,b,c\}$ are not context-free $L = \{a^nb^m:\text{n is prime or m is prime}\}$.
316
views
0 answers
0 votes
Rishi yadav asked Apr 15, 2019
316 views
Show that the following languages on $\Sigma = \{a,b,c\}$ are not context-free. $L = \{w\in\{a,b,c\}^*:n_a(w)+n_b(w)=2n_c(w),n_a(w) = n_b(w)\}$.
192
views
0 answers
0 votes
Rishi yadav asked Apr 15, 2019
192 views
Show that the following languages on $\Sigma = \{a,b,c\}$ are not context-free. $L=\{w:n_a(w)/n_b(w) = n_c(w)\}$.