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. Theory of Computation michael-sipser theory-of-computation turing-machine decidability proof + – admin asked Oct 17, 2019 edited Oct 17, 2019 by Lakshman Bhaiya admin 163 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.