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
In the context of abstract-syntax-tree (AST) and control-flow-graph (CFG), which one of the following is True?
For any two languages L1 and L2 such that L1 is context free and L2 is recursively enumerable but not recursive, which of the following is/are necessarily true?...
A student wrote two context-free grammars G1 and G2 for generating a single C-like array declaration. The dimension of the array is at least one. For example,...
Total Unique Visitors
Loading......