Consider \(𝐿 = 𝐿_1∩𝐿_2\) where \(L_1 = \{ 0^m 1^m 20^n 1^n \mid m,n \geq 0…

PYQ UGC NET 2020

Consider 𝐿=𝐿1∩𝐿2𝐿 = 𝐿_1∩𝐿_2 where

L1={0m1m20n1n∣m,n≥0}L2={0m1n2k∣m,n,k≥0}L_1 = \{ 0^m 1^m 20^n 1^n \mid m,n \geq 0 \} \\ L_2 = \{0^m1^n2^k \mid m,n,k \geq 0 \}

Then, the language 𝐿 is

  1. A.

    Recursively enumerable but not context free

  2. B.

    Regular

  3. C.

    Context free but not regular

  4. D.

    Not recursive

Attempted by 100 students.

Sign up free to check your answer

Sign up free

Explore the full course: Nta Ugc Net Paper 2

Loading lesson…