Medvedev machine

In theoretical computer science , a Medvedev automaton is understood to be a finite automaton , the output of which is directly the state (while in the Moore automaton it follows from the memory state). The name comes from Ju. T. Medvedev , who attached his own article to a translation of Automata Studies into Russian.

The states are used as an indicator, with some machines having acceptance states (end states). Such a Medvedev machine is also called an acceptor . Medvedev machines are particularly easy to implement; Mealy machines and Moore machines are more complex . The Medvedev machine is a special case of the Moore machine.

Individual evidence

^ CE Shannon, J. McCarthy (Eds.): Automata Studies . Princeton University Press, 1956, pp. 129-153.
↑ Ю. Т. Медведев: О классе событий, допускающих предсавление в конечном автомате . В сб. Автоматы. ИЛ, Moscow 1956, pp. 385-401.
↑ Yu. T. Medvedev: On the class of events representable in a finite automaton . Sequential Machines: Selected Papers. Addison-Wesley, 1964.
^ Arto Salomaa: Composition Sequences and Synchronizing Automata . LNCS 7160. Springer, Berlin / Heidelberg 2012, pp. 403-416.

[1] CE Shannon, J. McCarthy (Eds.): Automata Studies . Princeton University Press, 1956, pp. 129-153.

[2] Ю. Т. Медведев: О классе событий, допускающих предсавление в конечном автомате . В сб. Автоматы. ИЛ, Moscow 1956, pp. 385-401.

[3] Yu. T. Medvedev: On the class of events representable in a finite automaton . Sequential Machines: Selected Papers. Addison-Wesley, 1964.

[4] Arto Salomaa: Composition Sequences and Synchronizing Automata . LNCS 7160. Springer, Berlin / Heidelberg 2012, pp. 403-416.