Let \(𝐿_1\) and \(𝐿_2\) be languages over \(Σ=\{𝑎,𝑏\}\) represented by the…

PYQ UGC NET 2020

Let 𝐿1𝐿_1 and 𝐿2𝐿_2 be languages over Σ={𝑎,𝑏}Σ=\{𝑎,𝑏\} represented by the regular expressions (𝑎∗+𝑏)∗(𝑎^∗+𝑏)^∗ and (𝑎+𝑏)∗(𝑎+𝑏)^∗ respectively.

Which of the following is true with respect to the two languages?

  1. A.

    L1⊂L2L_1 \subset L_2

  2. B.

    L2⊂L1L_2 \subset L_1

  3. C.

    L1=L2L_1 = L_2

  4. D.

    L1∩L2=ϕL_1 \cap L_2 = \phi

Attempted by 234 students.

Sign up free to check your answer

Sign up free

Explore the full course: Nta Ugc Net Paper 2

Loading lesson…