Computer Sciences > Gate 2015 Set-1 > CFG
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?
I. L1' (complement of L1) is recursive
II. L2' (complement of L2) is recursive
III. L1' is context-free
IV. L1' ∪ L2 is recursively enumerable
II. L2' (complement of L2) is recursive
III. L1' is context-free
IV. L1' ∪ L2 is recursively enumerable
Correct : CFG
Similar Questions
In the context of abstract-syntax-tree (AST) and control-flow-graph (CFG), which one of the following is 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,...
Consider the following languages:
L1= {anbmcn+m : m, n >= 1}
L2= {anbnc2n : n >= 1}
Which one of the following is TRUE?
Total Unique Visitors
Loading......