A Mealy machine is a finite state machine that has an output value rather than a final state. For a given input, the machine generates a corresponding output. The output of the Mealy machine depends on the present state of the FA as well as the current input symbol.
Unlike other finite automata that determine the acceptance of a particular string in a given language, Mealy machines determine the output against the given input.
The Mealy machine is a 6 tuple machine
Note: The output function means that for every transition at a particular state, there is a corresponding output associated with it.
The Mealy machine forms an FA of the type:
In the machine above, the transition on input
Note: If the input string is of length
, the output produced by a Mealy machine will also be of length .
Suppose we have the following Mealy machine:
Now, we take an input string in
The transition table for the above machine will be:
Destination State for 0
Output at 0
Destination State for 1
Output at 1
View all Courses