Computer Sciences > GATE 2021 SET-2 > Formal Languages
Let L1 be a regular language and L2 be a context-free language. Which of the following languages is/are context-free?
A
L1 ∩ L2
B
L1 ∪ L2
C
L1 ∪ (L2 ∪ L2)
D
(L1 ∩ L2) ∪ (L1 ∩ L2)

Correct : b; c; d

Similar Questions

For a string w, we define wR to be the reverse of w. For example, if w = 01101 then wR = 10110. Which of the following languages is/are context-free?
#1097 MSQ
For a string w, we define wR to be the reverse of w. For example, if w = 01101 then wR = 10110. Which of the following languages is/are context-free?
#1097 MSQ
For a string w, we define wR to be the reverse of w. For example, if w = 01101 then wR = 10110. Which of the following languages is/are context-free?
#1097 MSQ

Related Topics

No tags found

Unique Visitor Count

Total Unique Visitors

Loading......
Question Options

Contributed by: