Question: Prove that EQ DFA is decidable by testing the two DFAs on all strings up to a certain size. Calculate a size that works.
Prove that EQDFA is decidable by testing the two DFAs on all strings up to a certain size. Calculate a size that works.
Step by Step Solution
3.37 Rating (166 Votes )
There are 3 Steps involved in it
To determine whether they accept the same language we look at the fact that every NFA has a minimal ... View full answer
Get step-by-step solutions from verified subject matter experts
