DFA product construction for intersection, union, and symmetric difference

Run two DFAs in lockstep on the same input — states are pairs ⟨q1,q2⟩ — then pick the accepting pairs to realize any Boolean combination: AND for ∩, OR for ∪, XOR for symmetric difference, AND-NOT for set difference.