In the theory of computation, a Moore machine is a finite-state machine whose output values are determined solely by its current state. This is in contrast to a Mealy machine, whose output values are determined both by its current state and by the values of its inputs. The Moore machine is named after Edward F. Moore, who presented the concept in a 1956 paper, “Gedanken-experiments on Sequential Machines.”
Read more about Moore Machine: Formal Definition, Comparison, Gedanken-experiments
Famous quotes containing the words moore and/or machine:
“Hindered characters
seldom have mothers
in Irish stories, but they all have grandmothers.”
—Marianne Moore (1887–1972)
“The machine unmakes the man. Now that the machine is perfect, the engineer is nobody. Every new step in improving the engine restricts one more act of the engineer,—unteaches him.”
—Ralph Waldo Emerson (1803–1882)