The intersection of two finite-state automata produces an automaton with the cross product state set.
if F has m states and G has n states, then F ∩ G has up to mn states (fewer if some of the mn possible states do not lie on any accepting path).