Cross produkt automaton from automata with different alphabet

180 Views Asked by At

Is it theoretically possible to create an automaton (which then would probably need to be nondeterministic) from two automata with different alphabets (where $\vert\Sigma_1 \cap \Sigma_2\vert \gt 0$)?