Extended regular expression and language intersection of DFAs

I am new with the extended regular expression and I want to know if there are connections with the problem of non-emptiness of intersection of the DFA languages.
I would like to see some research articles on this issue.