[math-fun] Complexity of detecting whether the intersection of two regular languages is empty?

Given two regular expressions, how hard is it to tell whether they unify, i.e. whether the intersection of the languages they denote is empty? -- Mike Stay - metaweta@gmail.com http://www.cs.auckland.ac.nz/~mike http://reperiendi.wordpress.com