-
Which of the following languages are context-free?
L1 = {ambn anbm | m, n ≥ 1}
L2 = {ambn ambn | m, n ≥ 1}
L3 = {ambn | m = 2n + 1}
-
- L1 and L2 only
- L1 and L3 only
- L2 and L3 only
- L3 only
- L1 and L2 only
Correct Option: C
L1 = { ambn anbm ⇒ This one is CFL
L2 = ambn ambn ⇒ by pumping lemma this one is not CFL.
L3 = ambn | m = 2n + 1 ⇒ This is CFL.
