moore和mealy_Mealy机和Moore机的比较研究目录

moore和mealy

Finite automata may also have outputs corresponding to each input symbol. Such finite automata are known as finite automata with the output.

有限自动机还可以具有与每个输入符号相对应的输出。这种有限自动机称为输出的有限自动机。

There are two finite state machines with outputs namely Mealy machine and Moore machine.

有两个输出的有限状态机，即Mealy机和Moore机 。

1)机器 (1) Mealy machine )

A finite state machine whose output generated depends on both the present state and the present input is called a mealy machine.

其生成的输出既取决于当前状态又取决于当前输入的有限状态机称为粉状机。

It is represented by 6 tuples (Q, ∑, O, δ, X, q0):

它由6个元组(Q，∑，O，δ，X，q0)表示 ：

Q is a set of states. It is finite in number.

Q是一组状态。它的数量是有限的。
>∑ is a set of symbols called the input alphabets. They are also finite.

> ∑是一组称为输入字母的符号。它们也是有限的。
O is a set of symbols called the output alphabets. They cannot be infinite in number.

O是一组称为输出字母的符号。它们的数量不能无限。
δ is the input transition function which maps Q × ∑ into Q.

δ是将Q×∑映射到Q中的输入转换函数。
X is the output transition function which maps Q × ∑ into O.

X是将Q×∑映射到O的输出转换函数。
q0 is the initial start state from where any input starts getting processed (q0 ∈ Q).

q0是初始开始状态，从该状态开始处理任何输入(q0∈Q) 。

2)摩尔机 (2) Moore machine)

Finite state machine whose output depends only on the present state.

有限状态机，其输出仅取决于当前状态。

It is represented by 6 tuples (Q, ∑, O, δ, X, q0):

它由6个元组(Q，∑，O，δ，X，q0)表示 ：

Q is a set of states. It is finite in number.

Q是一组状态。它的数量是有限的。
∑ is a set of symbols called the input alphabets. They are also finite.

∑是一组称为输入字母的符号。它们也是有限的。
O is a set of symbols called the output alphabets. They cannot be infinite in number.

O是一组称为输出字母的符号。它们的数量不能无限。
δ is the input transition function where δ maps Q × ∑ into Q.

δ是输入转换函数，其中δ将Q×∑映射到Q中。
X is the output transition function where X Maps Q into O.

X是输出转换函数，其中X将 Q映射为O。
q0 is the initial start state from where any input starts getting processed (q0 ∈ Q).

q0是初始开始状态，从该状态开始处理任何输入(q0∈Q) 。

.minHeight{ min-height: 250px; } @media (min-width: 1025px){ .minHeight{ min-height: 90px; } } .minHeight{ min-height: 250px; } @media (min-width: 1025px){ .minHeight{ min-height: 90px; } }

Mealy机器和Moore机器之间的比较/差异 (Comparison/Differences between Mealy machine and Moore machine )

Mealy Machine	Moore machine
Output depends on both upon present state and present input.	Output depends only upon present state.
it has less states than Moore machine.	it has more states than mealy machine.
It reacts faster to inputs.	It reacts slower to inputs because more logic is required.
In same clock cycle.	There are more circuit delays.
The output is placed on transitions.	Output is placed on the states.
Less hardware is need to design.	More hardware is required.
If there is a change in input then output also changes.	There is no change in output if input changes.
It is very difficult to design.	It is easy to design.

机器	摩尔机
输出取决于当前状态和当前输入。	输出仅取决于当前状态。
它的状态少于摩尔机。	它的状态比粉尘机还多。
它对输入的React更快。	它对输入的React较慢，因为需要更多的逻辑。
在相同的时钟周期内。	有更多的电路延迟。
输出放置在过渡上。	输出放置在状态上。
设计所需的硬件更少。	需要更多硬件。
如果输入发生变化，则输出也会发生变化。	如果输入发生变化，则输出不会发生变化。
设计非常困难。	这很容易设计。

翻译自: https://www.includehelp.com/toc/comparative-study-of-mealy-machine-and-moore-machine.aspx

moore和mealy