Given two NFAs, is there a way to figure out if there exists a language that works for both of them?

Question

Given two non-deterministic finite automaton, is there a way to determine if there exists a single language that satisfies them both?

Answer 1

There is an algorithm to convert them to deterministic finite-state automata. Then you can use any of the algorithms mentioned in this question and the answers to it.