Consider the following grammar over the alphabet abc given below S and T are non terminals 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?

Ask 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

Consider the following grammar over the alphabet {a,b,c} given below, S and T are non-terminals. -gate computer science 2017

G1: S-->aSb|T
T--> cT|∈

G2: S-->bSa|T
T--> cT|∈
The language L1(G1) ∩ L2(G2).
A) Finite
B) Non-finite but regular
C) Context-free but not regular
D) Recursive but not context-free


Taged users:


Be first to dislike this question

Talk about thisDelete|Like|Dislike|


B) Non-finite but regular

The language generated by grammar G1 is anc*bn where n>=0 
The language generated by grammar G2 is bnc*an where n>=0 
The intersection of two languages will be c* (putting n=0 in both languages)
We know that c* is a regular language and infinite, so option b is correct.
This explanation is contributed by Deepak Raj


Be first to like this answer

Be first to dislike this answer
Talk about this|Once you have earned teacher badge you can edit this questionDelete|Like|Dislike|

Can you help us to add better answer here? Please see this

Not the answer you're looking for? Browse other questions from this Question paper or ask your own question.

Join eduladder!