Ask Question
7 December, 19:06

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).

+4
Answers (1)
  1. 7 December, 20:13
    0
    If L (D1) = L (D2), the D has every state being final

    If L (D1) = L¯ (D2), the D has every state being final

    If L (D1) = ∅, then L (D) = L (D2).

    If L (D1) = Σ, L (D) = L (D2)
Know the Answer?
Not Sure About the Answer?
Get 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 there is no answer or all answers are wrong, use a search bar and try to find the answer among similar questions.
Search for Other Answers