Consider the following languages over the alphabet ∑ = {a, b, c} Let L 1 = {a n b n c m | m, n ≥ 0} and L 2 = {a m b n c n | m, n ≥ 0} Which of the following are context-free languages? I. L 1 ∪ L 2 II. L 1 ∩ L 2

GATE Computer Science (CS) 2017 Shift 1 Solved Paper

Question : 48 of 65

Marks: +1, -0

Consider the following languages over the alphabet ∑ = {a, b, c}
Let L₁ = {aⁿ bⁿ c^m | m, n ≥ 0} and L₂ = {a^mbⁿ cⁿ| m, n ≥ 0}
Which of the following are context-free languages?
I. L₁ ∪ L₂
II. L₁ ∩ L₂

I only
II only
I and II
Neither I nor II

Validate

Go to Question:

Prev Question

Next Question