Let L = L1∩L2, where L1 and L2 are languages as defined below: L1 = {am bm can…
GATE · 2009 · CS
Let L = L1∩L2, where L1 and L2 are languages as defined below:
L1 = {am bm can bn | m, n >= 0}
L2 = {ai bj ck | i, j, k >= 0}
Then L is
- A.
Not recursive
- B.
Regular
- C.
Context free but not regular
- D.
Recursively enumerable but not context free.
Attempted by 86 students.
Sign up free to check your answer
Sign up freeLoading lesson…