Editing Moore machine (section)

{{Short description|Finite-state machine whose output values are determined only by its current state}}
{{More citations needed|date=November 2024}}
In the [[theory of computation]], a '''Moore machine''' is a [[finite-state machine]] whose current output values are determined only by its current [[state (computer science)|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. Like other finite state machines, in Moore machines, the input typically influences the next state. Thus the input may indirectly influence subsequent outputs, but not the current or immediate output. The Moore machine is named after [[Edward F. Moore]], who presented the concept in a 1956 paper, “[[Thought experiment|Gedanken-experiments]] on Sequential Machines.”<ref name="gedanken">{{cite journal| last=Moore| first=Edward F| title=Gedanken-experiments on Sequential Machines| pages=129–153| journal=Automata Studies, Annals of Mathematical Studies| issue=34| publisher=Princeton University Press| location=Princeton, N.J.| year=1956}}</ref>