The synchronous product of two automatas is a way to combine two finite automata into a single automaton, which accepts the intersection of the languages accepted by the two original automata. The product is also called Cartesian product or Intersection automaton.
Intuitively, executing an input on the product automata is like synchronously executing the input on the two automatas independently, and accepting if both the automata accept.