Take the 2-minute tour ×
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.

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

share|improve this question

1 Answer 1

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|improve this answer
    
Thanks this helps a lot. –  Takkun Sep 12 '12 at 21:56

Your Answer

 
discard

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.