0 votes 0 votes Let $A = \{\langle{ M \rangle} \mid \text{M is a DFA that doesn’t accept any string containing an odd number of 1s}\}$.Show that $A$ is decidable. Theory of Computation michael-sipser theory-of-computation decidability proof + – admin asked Oct 17, 2019 admin 150 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.