GATE | CS | 2017 | Set 1 | TOC | Closure Property | Question 42

Last Updated :
Discuss
Comments

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

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

G2: S-->bSa|T
T--> cT|∈

The language L1(G1) ∩ L2(G2).

Finite

Non-finite but regular

Context-free but not regular

Recursive but not context-free

This question is part of this quiz :

GATE-CS-2017 (Set 1),Theory of Computation GATE CS PYQ Quiz,RELs , Turing Machine & Closure properties PYQ QUIZ GATE CS
Tags:
GATE
GATE CS
Theory of Computation
Share your thoughts in the comments