- In the theory of computation, a Moore machine is a finite-state machine whose output values are determined only by its current state.
- If the input has n symbol, the output will contain n+1 symbol because at the intial state we already have one symbol present before we start the actual computation of input symbol.
Example of Moore Machine:
Here you can clearly see that for every state is associated with output.
Moore Transition Table for the above machines is:
for this, you try to form the Transition table.