Q52 Consider the following languages over the alphabet abc Let L1 an bncm m n 0 and L2 ambncn m n 0 gate computer science 2017
The Eduladder is a community of students, teachers, and programmers just interested to make you pass any exams. So we solve previous year question papers for you.
See Our team
Wondering how we keep quality?
Got unsolved questions?

Hey! Want to work with us? Our youtube channel See our Jd Want to apply? Do it today

### Use Me  ?

New searches
GATE-Computer-Science-Engineering-2017-->View question

## Q.52) Consider the following languages over the alphabet ∑= {a,b,c}. Let L1 = {an bncm | m, n >= 0 } and L2 = {ambncn| m, n >= 0}. -gate computer science 2017

Which of the following are context-free languages ?
I. L1 ∪ L2
II. L1 ∩ L2
A) I only
B) II only
C) I and II
D) Neither I nor II

By:satyashiromani

Taged users:

Likes:
|satyashiromani|deepuckraj|Vishu-vashistha|Oshal-Borkar

Dislikes:
Be first to dislike this question

A) I only

Explanation:
Union of context free language is also context free language.
L1 = { an bn cm| m >= 0 and n >= 0 } and
L2 = { am bncn| n >= 0 and m >= 0 }
L3 = L1 ∪ L2 = { anbncm∪ ambncn| n >= 0, m >= 0 } is also context free.
L1 says number of a’s should be equal to number of b’s and L2 says number of b’s should be equal to number of c’s. Their union says either of two conditions to be true. So it is also context free language.
Intersection of CFG may or may not be CFG.
L3 = L1 ∩ L2 = { anbncn| n >= 0 } need not be context free.

This explanation is contributed by Deepak Raj

deepuckraj

Likes:
Be first to like this answer

Dislikes:
Be first to dislike this answer