0 votes 0 votes Prove that $EQ_{DFA}$ is decidable by testing the two DFAs on all strings up to a certain size. Calculate a size that works. Theory of Computation michael-sipser theory-of-computation finite-automata decidability proof + – admin asked Oct 17, 2019 admin 256 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.