Moore machine


Also found in: Wikipedia.

Moore machine

[′mu̇r mə‚shēn]
(computer science)
A sequential machine in which the output depends uniquely on the current state of the machine, and not on the input.
References in periodicals archive ?
Project Name: Moore machine temperature control system of guangdong university of technology and the center hole grinding machine purchasing project (heavy)
3 A Deterministic Moore Machine is a 6-tuple M = (Q, [SIGMA], B, [delta], [q.
4 The DFA associated with a Moore Machine M = Q, [SIGMA] {0, 1, ?
5 Given a Moore Machine M = (Q, [SIGMA], B, [delta], [q.
A Moore machine is a six-tuple Mo = (Q,[SIGMA], [DELTA], [delta],[lambda],[q.
7] used genetic simulation for Moore machine identification, Tongchim and Chongstitvatana [8] investigated parallel implementation of the GA to solve the problem of FSM synthesis.
An interesting branch of this literature has analyzed the infinite RPD as a game in which two "metaplayers" choose a strategy which is implemented by a finite automation, or Moore machine.
Jeffrey Banks and Rangarajan Sundaram [4] have shown if we use preferences which are lexicographic in complexity and use the number of transitions in the Moore machine as the measure of complexity, the only Nash equilibrium machine defects always.
A similar heuristic approach is used in the paper by Maragarita Spichakova "An approach to the inference of finite state machines based on a gravitationally-inspired search algorithm" for generation of Moore machines, a version of final state machines with output.
5" impellers, TAPS plans to use the Moore machines on impellers up to 10," assuming demand for those sizes ramps up.
TAPS has tuned the Moore machines to operate at a 25 to 50 percent higher loop gains than leading European competitors, reducing following error to virtually zero.
Moore machines, the most popular form of automaton used in the game theory literature, are explained.