0 votes 0 votes Let $BAL_{DFA} = \{ \langle M \rangle \mid \text{ M is a DFA that accepts some string containing an equal number of 0s and 1s}\}$. Show that $BAL_{DFA}$ is decidable. (Hint: Theorems about $CFLs$ are helpful here.) Theory of Computation michael-sipser theory-of-computation finite-automata decidability proof + – admin asked Oct 17, 2019 edited Oct 17, 2019 by Lakshman Bhaiya admin 231 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.