In the theory of computation, a Mealy machine is a finite-state machine whose output values are determined both by its current state and the current inputs. (This is in contrast to a Moore machine, whose output values are determined solely by its current state.)
Read more about Mealy Machine: History, Formal Definition, Diagram, Applications
Famous quotes containing the words mealy and/or machine:
“I never see any difference in boys. I only know two sorts of boys. Mealy boys, and beef-faced boys.”
—Charles Dickens (1812–1870)
“The cycle of the machine is now coming to an end. Man has learned much in the hard discipline and the shrewd, unflinching grasp of practical possibilities that the machine has provided in the last three centuries: but we can no more continue to live in the world of the machine than we could live successfully on the barren surface of the moon.”
—Lewis Mumford (1895–1990)