Moore vs Mealy Machines: Memory Presence and Construction Details - Automaty Moore'a i Mealy'ego

Hello.

which of these machines has a memory? Moore or Mealy?
and maybe someone knows the construction of these machines? I couldn't find anything specific about it on googles. thank you in advance for your help . greetings.

aka103.

Both machines have memory because they are types of sequencing. The difference between these machines is that:
for the slot machine Mealy the initial state of the device at the time t + 1 depends directly both on the internal states of the automaton and the states of the inputs, while for the automaton Moore the state of the outputs in the next cycle depends directly only on the internal states.
The difference is small, but you can feel it when designing such systems "on paper" ... . Regards

It seems to me that this behavior of the Moore automaton can be interpreted as memory because despite the change in the inputs, the state of the outputs does not change (as long as we are in the same state). The machine, therefore, as if remembers what was before.

Consul, I think so too, but I am not sure about the concrete wall, and that it is taken as a memory machine and the other is not sure about it. in any case, everything would point to Moore, the more that flip-flops are sequences of the Moore type.

Hello,
the very definitions of both automata do not differ much from each other, although they are quite lengthy.
Mealy's (finite) automaton is by definition an ordered "five":
M =
wherein:
X = {x1, ..., xn} - a set of input letters (signals) (input alphabet),
S = {s1, ..., sn} - a set of internal states (internal alphabet),
Y = {y1, ..., yn} - set of output letters (signals) (output alphabet),
these sets are finite and non-empty.
?: D? -> S - transition function (transient)
?: D? -> Y - output function (output)
Whereas:
D? - transition function domain,
D? - the domain of output functions.
The transition function assigns each pair consisting of the input letter and the current state and belonging to D? - next state.
The function of outputs assigns each pair of the initial letter and the current state and belonging to D? - the initial letter.

A Moore-type (finite) automaton is defined from the definition of a Mealy (finite) automaton for which there is a specific condition:
D? is contained in S (the domain of the function of outputs in the set of internal states).

The given definitions show that in the case of a Mealy automaton, the initial letters are associated with changes of states - with transitions, and in the case of a Moore automaton - with states.
There is a close relationship between Mealy-type automata and Moore-type automata: having a given automaton of one type, one can always give an automaton of the other type, equivalent to it in a certain sense.
Regards

Hello,

Misiek.Power wrote:

A friend spilled definitions that hey ...

Only on this basis can he answer the question of the author of the topic?

good question, but it is contained in the above definitions. I, of course, know the answer, but let the author of the topic come to that ...
The answer went to PW, please keep it ...
Regards

hm. however, I would ask for a specific answer, because I know the definitions well, but I can't remember the one that is from the memory of them, so, particulars, gentlemen, particulars.