Teaching TN TRB CS Mock Test Theory of Computation Context Free Languages and Pushdown Automata Context Free Languages
If L1 and L2 are context free language, then which of the following is always accepted by pushdown automaton (PDA)?
1
\({L_1}\;U\;{L_2}\)
2
\({L_1} - \;{L_2}\)
3
\({L_1} \cap \;{L_2}\)
4
\(\overline {{L_1}\;U\;{L_2}} \)