Convert both regular expressions to a DFA, compute the symmetric difference of the two DFA's using a product construction, and then check whether the result accept the non-empty language.  Each of those steps is described here on this site.  See also http://cs.stackexchange.com/q/2851/755 for a very similar question.