Question

Prove that EQDFAEQDFA is decidable by testing the two DFAs on all strings up to a certain size. Calculate a size that works.

Answer 1

Following are the solution to the given question:

Step-by-step explanation:

When a finite computation c has n conditions in c this is not possible to obtain a string with such a minimum of n-1 letters or nation. Guess 1 wants to check whether

`L(C)= \Sigma * \ if \ C`

is dissuasive, then all the states reachable should agree. This could be tested if all sentences up to n-1 are in the language.