0 votes 0 votes Let $INFINITE_{DFA} = \{\langle{ A \rangle} \mid \text{ A is a DFA and L(A) is an infinite language}\}$. Show that $INFINITE_{DFA}$ 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 179 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.