800 views
0 votes
0 votes
Is language CFL?

L={w: 2n(a) <= n(b) <= 3 n(c)}

Please log in or register to answer this question.

Related questions

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}\}$.
2.0k
views
1 answers
2 votes
Shubhanshu asked Jul 8, 2017
1,978 views
Q3) Given,$L_1 = (aaa^*b)$L_2 = (aab^*aba^*)$Find (c) the union of $L_1$ and $L_2$, and also find (d) $L_1 - L_2$.Q4) Find the npda's of the following:f) $L = \{ a^nb ... $L = \{w : 2n_a(w) \leq n_b(w)) \leq 3n_a(w) \}$.
409
views
0 answers
0 votes
740
views
1 answers
1 votes
sajjan asked Jan 10, 2017
740 views
Is the language L={anbm :n=m or n=m+2} deterministic?