Computer Sciences > Gate 2022 > 1
Which of the following statements is/are TRUE?
A
Every subset of a recursively enumerable language is recursive.
B
If a language L and its complement L are both recursively enumerable, then L must be recursive.
C
The complement of a context-free language must be recursive.
D
If L1 and L2 are regular, then L1∩ L2 must be deterministic context-free.

Correct : b,c,d

Similar Questions

Consider the following three relations in a relational database. Employee (eId, Name ), Brand (bId, bName), Own (eId, bId ) Which of the following relational al...
#336 MSQ
Consider the following three relations in a relational database. Employee (eId, Name ), Brand (bId, bName), Own (eId, bId ) Which of the following relational al...
#336 MSQ
Consider the following three relations in a relational database. Employee (eId, Name ), Brand (bId, bName), Own (eId, bId ) Which of the following relational al...
#336 MSQ

Related Topics

No tags found

Unique Visitor Count

Total Unique Visitors

Loading......
Question Options

Contributed by: