Consider the following languages: L 1 = {a n b m c n + m : m, n ≥ 1} L 2 = {a n b n c 2n : n ≥ 1} Which one of the following is TRUE?

Correct Answer is : L1 is context-free while L2 is not context-free

Both L 1 and L 2 are context-free

L 1 is context-free while L 2 is not context-free

L 2 is context-free while L 1 is not context-free

Neither L 1 nor L 2 is context-free

GATE Computer Science (CS) 2016 Shift 2 Solved Paper

Question : 53 of 65

Marks: +1, -0

Consider the following languages:
L₁ = {aⁿb^mc^{n + m}: m, n ≥ 1}
L² = {aⁿbⁿc²ⁿ: n ≥ 1}
Which one of the following is TRUE?

Go to Question:

Prev Question

Next Question