
 Moore machine  Wikipedia, the free encyclopedia 
  In the theory of computation, a Moore machine is a finite state automaton where the outputs are determined by the current state alone (and not on the input). 
  The name Moore machine comes from that of their promoter: Edward F. Moore, a state machine pioneer, who wrote Gedankenexperiments on Sequential Machines, pp 129 – 153, Automata Studies, Annals of Mathematical Studies, no. 34, Princeton University Press, Princeton, N. Most electronics are designed as clocked sequential systems. 
  The number of states in a Moore machine will be greater than or equal to the number of states in the corresponding Mealy machine. 
 en.wikipedia.org /wiki/Moore_machine (393 words) 
