We can express the Mealy machine in tabular form as indicated below.
|
The entry b/0 for the raw q1 & column q2indicates that there is a transition from state q1 to state q2 on input b and the output associated with this transition is 0. For no transition defined from state p to state q the entry for raw p & column q will be  |
Equivalence of Moore and Mealy machines
Since Moore and Mealy machines both produces output (instead of normal convention of accepting a language by a FA ). We can compare them in the sense that they are equivalent if they always produce the same output string in response to the same input string. But
there can never be an exact match between the output strings produced by them since the length of the output string of a Moore machine is always one more than that of a Mealy machine in response to the same input string. However, if we ignore the response of a Moore machine for its initial state (i.e. response to input 
), then we can define the equivalence of a Moore machine, 
and a Mealy machine 
by saying that if for all input string 
, where 
is the output of for its initial state and 
are outputs of and on w respectively.
Then they are equivalent