Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

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

share|cite|improve this question
up vote 2 down vote accepted

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.

share|cite|improve this answer
Thanks this helps a lot. – Takkun Sep 12 '12 at 21:56

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.