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 recurrence: f(1) = 1; f(2n) = 2f(n) -1, for n≥1; f(2n+1) = 2f(n) +1, for n≥1; Then, which of the following statements is/are TRUE?
#321 MSQ
Consider the following languages: L1 = {ww | w ∈ {a, b}* } L2 = {anbncn | m, n≥ 0} L3 = {ambncn | m, n≥ 0} Which of the following statements is/are FALSE?
#322 MSQ
Which of the following statements is/are TRUE with respect to deadlocks?
#323 MCQ

Related Topics

No tags found

Unique Visitor Count

Total Unique Visitors

Loading......

Question Options

Contributed by: