Computer Sciences > Gate 2017 Set-1 > CFG
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 context-free languages ?
I. L1 ∪ L2
II. L1 ∩ L2
Let L1 ={anbncm | m, n >= 0 } and
L2 = {ambncn| m, n >= 0}.
Which of the following are context-free languages ?
I. L1 ∪ L2
II. L1 ∩ L2
Correct : a
Similar Questions
If G is grammar with productions
S → SaS | aSb | bSa | SS | ∈
where S is the start variable, then which one of the following is not generated by G?
If G is grammar with productions
S → SaS | aSb | bSa | SS | ∈
where S is the start variable, then which one of the following is not generated by G?
If G is grammar with productions
S → SaS | aSb | bSa | SS | ∈
where S is the start variable, then which one of the following is not generated by G?
Total Unique Visitors
Loading......