Consider the context-free grammars over the alphabet $\left \{ a, b, c \right \}$ given below. $S$ and $T$ are non-terminals.
$G_{1}:S\rightarrow aSb \mid T, T \rightarrow cT \mid \epsilon$
$G_{2}:S\rightarrow bSa \mid T, T \rightarrow cT \mid \epsilon$
The language $L\left ( G_{1} \right )\cap L(G_{2})$ is
- Finite
- Not finite but regular
- Context-Free but not regular
- Recursive but not context-free