Consider \(𝐿 = 𝐿_1∩𝐿_2\) where \(L_1 = \{ 0^m 1^m 20^n 1^n \mid m,n \geq 0…
PYQ UGC NET 2020
Consider where
Then, the language 𝐿 is
- A.
Recursively enumerable but not context free
- B.
Regular
- C.
Context free but not regular
- D.
Not recursive
Attempted by 100 students.
Sign up free to check your answer
Sign up freeLoading lesson…

