Formal algorithm to test whether two given regular expressions define equal/identical or unequal languages
If behaviour of the automaton didn't depend on the final states, transition function and alphabet, why would we define automata to have those useless things?