Q. 42 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).
(A) Finite
(B) Non-finite but regular
(C) Context-free but not regular
(D) Recursive but not context-free
Answer: (B)
Explanation:
