0
$\begingroup$

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

1 Answers 1

2

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.