If Language $L_1$ is accepted by a Pushdown Automata and Language$ L_2$ by a Turing Machine, Is $L_1 \cup L_2$ accepted by a Pushdown Automata?

104 Views Asked by At

Let $L_1$ be a language recognized by a Pushdown automaton and let $L_2$ be another language recognized by a Turing machine. Is $L_1 \cup L_2$ recognized by a Pushdown automaton? Prove your answer.

1

There are 1 best solutions below

0
On

HINT: Suppose that $L_2$ is not recognizable by a pushdown automaton, and show that there is a regular $L_1\subseteq L_2$.