This situation can be handled by creating copies of the state q for all different outputs associated with incoming transitions (keeping all other things same) as shown below.
Number of states are increase to remember different output symbols associated with moving transitions, and hence, states are considered to be order pairs in the Mealy machine. This construction is presented formally in the theorem given below.
Theorem : If 
is a Mealy machine, then there is a Moore machine 
equivalent to 
.
Proof : We construct a Moore machine
