See Our team

Wondering how we keep quality?

Got unsolved questions?

Ask Questions

Engineering
GATE
CBSE
NCERT
Psychology
English
Computer
Constitution
Astrology
Yoga
Economics
Physics
Biology
Electronics
Microprocessor
Career
Interview
Anatomy
Botany

## 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

By:satyashiromani

Taged users:

|satyashiromani|vaishnavi-Deshpande|milanyoyoyogmailcom|Umang|ThreeRed|Msshikhil|13priya|deepuckraj|Manisha12|Aparna-Dasgupta|milan-ransingh|aksingh1818|leo|Aaditi|madachod|tichaona-garaidenga|ronald|jinsnjjose|dillu550|sumesh|Abdul-Wajid|Vinit|thegdx|metaphor|Raju-bhai|Asgar-Ali|Aditya-Kashyap||Tholakele|Akhil-Raj

Likes:

|aksingh1818

Dislikes:

Be first to dislike this question

Talk about thisDelete|Like|Dislike|

## Answers

**B) Non-finite but regular**

Explanation:

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__deepuckraj

Likes:

Be first to like this answer

Dislikes:

Be first to dislike this answer

Talk about this|Once you have earned teacher badge you can edit this questionDelete|Like|Dislike|

------------------------------------

## Use Me ?