From this, we can consider FA to be a special case of a Moore machine where the output alphabet and a state p is ‘accepting' if and only if .

So, a Moore machine can be said to recognize the language of all input strings whose outputs ends in a 1. In the example Moore machine given above if we make q₃ as final state and remove all outputs associated with the states, it will be a DFA accepting all string over that ends with .

Mealy machines :

A Mealy machine is a six-tuple, , where all elements are as in Moore machine, except for which is defined as

                        

This means that gives the output associated with the transition from state q on input .
Let the sequence of states the machine goes through in response to the input string is .