The language L(G1) ∩ L(G2) is
A. Finite.
B. Not finite but regular.
C. Context-Free but not regular.
D. Recursive but not context-free.
Answer:B
The language L(G1) ∩ L(G2) is
A. Finite. B. Not finite but regular. C. Context-Free but not regular. D. Recursive but not context-free.