|Algorithms for finding if two DFA's are equivalent Roger.Sindreu@gmail.com (2006-09-08)|
|Re: Algorithms for finding if two DFA's are equivalent Szabolcs.Ivan@gmail.com (Szabolcs Ivan) (2006-09-08)|
|Re: Algorithms for finding if two DFA's are equivalent firstname.lastname@example.org (2006-09-08)|
|Re: Algorithms for finding if two DFA's are equivalent email@example.com (sasha mal) (2006-09-08)|
|Re: Algorithms for finding if two DFA's are equivalent firstname.lastname@example.org (2006-09-08)|
|Date:||8 Sep 2006 12:24:46 -0400|
|Organization:||Department of Computer Science, University of Copenhagen|
|Posted-Date:||08 Sep 2006 12:24:46 EDT|
> I would like to know all the methods you know for finding if two DFA's
> are equivalent.
> I know the trivial algorithm which is finding the mininimum DFA for
> each DFA, and just check if they are equal. Do you know any other
> algorithm? Do not care much about its cost, this is not a goal for me.
You can test for bisimulation.
Or you can construct a DFA for the complement language of one of the
DFAs and then the intersection between this and the other and finally
test for emptyness.
From the pumping lemma, we can see that two DFAs are equivalent of
they agree on all strings under a certain length (that depends on the
number of states in the DFAs). So compute this length and compare the
DFAs on all strings under this length. This is bound to be the least
efficient way of testing equivalence.
Return to the
Search the comp.compilers archives again.