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