Given two non-deterministic finite automaton, is there a way to determine if there exists a single language that satisfies them both?
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.
Here's how it works:
- Anybody can ask a question
- Anybody can answer
- The best answers are voted up and rise to the top
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.