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
Explanation
Correct : a
Similar Questions
What is the worst-case time complexity of insertion in an AVL tree?
Which operations on a binary search tree have O(h) complexity?
Compare search complexities of sorted array vs balanced BST.