Computer Sciences > Gate 2016 Set-2 > CFG
Consider the following languages:
L1= {anbmcn+m : m, n >= 1}
L2= {anbnc2n : n >= 1}
Which one of the following is TRUE?
L1= {anbmcn+m : m, n >= 1}
L2= {anbnc2n : n >= 1}
Which one of the following is TRUE?
Correct : CFG
Similar Questions
Consider the following languages over the alphabet ∑= {a,b,c}.
Let L1 ={anbncm | m, n >= 0 } and
L2 = {ambncn| m, n >= 0}.
Which of the following are conte...
Consider the following languages over the alphabet ∑= {a,b,c}.
Let L1 ={anbncm | m, n >= 0 } and
L2 = {ambncn| m, n >= 0}.
Which of the following are conte...
Consider the following languages over the alphabet ∑= {a,b,c}.
Let L1 ={anbncm | m, n >= 0 } and
L2 = {ambncn| m, n >= 0}.
Which of the following are conte...
Total Unique Visitors
Loading......