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?

score 2 · Accepted Answer · edited Apr 13 '17 at 12:21

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.

edited Apr 13 '17 at 12:21

Community

1

answered Sep 12 '12 at 21:54

Brian M. Scott

616,228

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

1 Answers1