in Theory of Computation edited by
171 views
0 votes
0 votes
Let $INFINITE_{PDA} = \{\langle{ M \rangle} \mid \text{M is a PDA and L(M) is an infinite language}\}$. Show that $INFINITE_{PDA}$ is decidable.
in Theory of Computation edited by
by
171 views

Please log in or register to answer this question.

Related questions