<P> A moore machine with nine states for the above description is shown on the right . The initial state is state A, and the final state is state I . The state table for this example is as follows: </P> <Table> <Tr> <Th> Current State </Th> <Th> Input </Th> <Th> Next State </Th> <Th> Output </Th> </Tr> <Tr> <Td> </Td> <Td> 0 </Td> <Td> </Td> <Td> 0 </Td> </Tr> <Tr> <Td> </Td> <Td> </Td> <Td> </Td> <Td> 0 </Td> </Tr> <Tr> <Td> </Td> <Td> 0 </Td> <Td> </Td> <Td> 0 </Td> </Tr> <Tr> <Td> </Td> <Td> </Td> <Td> </Td> <Td> 0 </Td> </Tr> <Tr> <Td> </Td> <Td> 0 </Td> <Td> </Td> <Td> 0 </Td> </Tr> <Tr> <Td> </Td> <Td> </Td> <Td> </Td> <Td> 0 </Td> </Tr> <Tr> <Td> </Td> <Td> 0 </Td> <Td> </Td> <Td> 0 </Td> </Tr> <Tr> <Td> </Td> <Td> </Td> <Td> </Td> <Td> 0 </Td> </Tr> <Tr> <Td> </Td> <Td> 0 </Td> <Td> </Td> <Td> 0 </Td> </Tr> <Tr> <Td> </Td> <Td> </Td> <Td> </Td> <Td> 0 </Td> </Tr> <Tr> <Td> </Td> <Td> 0 </Td> <Td> </Td> <Td> 0 </Td> </Tr> <Tr> <Td> </Td> <Td> </Td> <Td> </Td> <Td> 0 </Td> </Tr> <Tr> <Td> </Td> <Td> 0 </Td> <Td> </Td> <Td> 0 </Td> </Tr> <Tr> <Td> </Td> <Td> </Td> <Td> </Td> <Td> 0 </Td> </Tr> <Tr> <Td> </Td> <Td> 0 </Td> <Td> </Td> <Td> 0 </Td> </Tr> <Tr> <Td> </Td> <Td> </Td> <Td> </Td> <Td> 0 </Td> </Tr> <Tr> <Td> </Td> <Td> 0 </Td> <Td> </Td> <Td> </Td> </Tr> <Tr> <Td> </Td> <Td> </Td> <Td> </Td> <Td> </Td> </Tr> </Table> <Tr> <Th> Current State </Th> <Th> Input </Th> <Th> Next State </Th> <Th> Output </Th> </Tr> <Tr> <Td> </Td> <Td> 0 </Td> <Td> </Td> <Td> 0 </Td> </Tr>

Difference between moore and mealy machine with example