How deciding if 2 deterministic finite automatas decide the same language? [duplicate]

Is there any polynomial procedure to decide if 2 deterministic finite automatas decide the same language?

• Yes, of course. This is covered in standard textbooks on automata theory. What research have you done? We expect you to do a significant amount of research before asking here, and to show us in the question what you've done (e.g., what textbooks you have consulted). You might also want to tell us what you know about automata theory (do you know the product construction? how to test whether a DFA generates the empty language?).
– D.W.
Commented Jul 2, 2014 at 22:32
• See, e.g., cs.stackexchange.com/q/9130/755 (two subset tests are enough to test equivalence), or cs.stackexchange.com/q/20042/755 plus cs.stackexchange.com/q/18616/755 (computing the difference plus testing for emptyness is sufficient). See also cs.stackexchange.com/q/21897/755 and cs.stackexchange.com/q/5010/755 for more related questions.
– D.W.
Commented Jul 2, 2014 at 22:37
• Hints: (1) Regular languages are closed under union, intersection, and complement, so are closed under symmetric difference. (2) Two sets are equal iff their symmetric difference is empty. (3) You can effectively determine whether the language of a finite automaton is empty. Now just fill in the details using the earlier comments' suggestions. Commented Jul 3, 2014 at 1:02
• I agree that is duplicated question, because the other is equivalent, but how could I see that? I was looking for "the same" language... I cannot serach for all possible equivalent way of writing the question... Anyway sorry!
– Jody
Commented Jul 3, 2014 at 7:23

Let $D_1,D_2$ be the automata in question, and let $L_1,L_2$ be the corresponding languages. Using standard construction one can construct an automaton $D$ for $L_1 \triangle L_2$ (the symmetric difference of $L_1$ and $L_2$), and then one checks whether this automaton accepts any words.