0 votes 0 votes Let $ALL_{DFA} = \{ \langle{ A }\rangle \mid A \text{ is a DFA and}\: L(A) = \Sigma^{\ast}\}.$ Show that $ALL_{DFA}$ is decidable. Theory of Computation michael-sipser theory-of-computation turing-machine finite-automata decidability proof + – admin asked Oct 15, 2019 • retagged Oct 15, 2019 by Lakshman Bhaiya admin 218 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.