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)
“Goodbye, boys; I’m under arrest. I may have to go to jail. I may not see you for a long time. Keep up the fight! Don’t surrender! Pay no attention to the injunction machine at Parkersburg. The Federal judge is a scab anyhow. While you starve he plays golf. While you serve humanity, he serves injunctions for the money powers.”
—Mother Jones (1830–1930)