Computer Sciences > GATE 2021 SET-2 > Formal Languages

Contributed by: Dr. Sarah Chen

Report Correct Copyright Claim

Let L₁ be a regular language and L₂ be a context-free language. Which of the following languages is/are context-free?

A

L₁ ∩ L₂

B

L₁ ∪ L₂

C

L₁ ∪ (L₂ ∪ L₂)

D

(L₁ ∩ L₂) ∪ (L₁ ∩ L₂)

Check Answer

Explanation

Correct : b; c; d

Similar Questions

What is the worst-case time complexity of insertion in an AVL tree?

Question #23 Medium

Which operations on a binary search tree have O(h) complexity?

Question #31 Easy

Compare search complexities of sorted array vs balanced BST.

Question #47 Hard

Related Topics

Data Structures Binary Search Tree Time Complexity Algorithm Analysis Tree Algorithms Computer Science