Suppose I have two DFAs D1, D2 and I perform the product construction on them to get a DFA for the union of their languages. What is always true about the resulting DFA D?
(a) The number of states in D is equal to the maximum of the number of states in both of D1, D2.
D.) If L (D1) = ∅, then L (D) = L (D2).
+3
Answers (1)
Know the Answer?
Not Sure About the Answer?
Find an answer to your question 👍 “Suppose I have two DFAs D1, D2 and I perform the product construction on them to get a DFA for the union of their languages. What is always ...” in 📗 Computers & Technology if the answers seem to be not correct or there’s no answer. Try a smart search to find answers to similar questions.
Home » Computers & Technology » Suppose I have two DFAs D1, D2 and I perform the product construction on them to get a DFA for the union of their languages.