Does an algorithm exist which can determine whether one regular language matches any input another regular language matches?

Let's say we have regular expressions:

• Hello W.*rld
• Hello World
• .* World
• .* W.*

I would like to minimize the number of regexes required to match arbitrary input.

To do that, I need to find if one regular expression matches any input matched by another expression. Is that possible?

Billy3