moore和mealy

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

有限自動機(jī)還可以具有與每個(gè)輸入符號相對應(yīng)的輸出。 這種有限自動機(jī)稱為輸出的有限自動機(jī)。

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

有兩個(gè)輸出的有限狀態(tài)機(jī)，即Mealy機(jī)和Moore機(jī) 。

1)機(jī)器 (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.

其生成的輸出既取決于當(dāng)前狀態(tài)又取決于當(dāng)前輸入的有限狀態(tài)機(jī)稱為粉狀機(jī)。

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

它由6個(gè)元組(Q，∑，O，δ，X，q0)表示 ：

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

  Q是一組狀態(tài)。 它的數(shù)量是有限的。

• >∑ 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是一組稱為輸出字母的符號。 它們的數(shù)量不能無限。

• δ is the input transition function which maps Q × ∑ into Q.

  δ是將Q×∑映射到Q中的輸入轉(zhuǎn)換函數(shù)。

• X is the output transition function which maps Q × ∑ into O.

  X是將Q×∑映射到O的輸出轉(zhuǎn)換函數(shù)。

• q0 is the initial start state from where any input starts getting processed (q0 ∈ Q).

  q0是初始開始狀態(tài)，從該狀態(tài)開始處理任何輸入(q0∈Q) 。

2)摩爾機(jī) (2) Moore machine)

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

有限狀態(tài)機(jī)，其輸出僅取決于當(dāng)前狀態(tài)。

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

它由6個(gè)元組(Q，∑，O，δ，X，q0)表示 ：

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

  Q是一組狀態(tài)。 它的數(shù)量是有限的。

• ∑ 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是一組稱為輸出字母的符號。 它們的數(shù)量不能無限。

• δ is the input transition function where δ maps Q × ∑ into Q.

  δ是輸入轉(zhuǎn)換函數(shù)，其中δ將Q×∑映射到Q中 。

• X is the output transition function where X Maps Q into O.

  X是輸出轉(zhuǎn)換函數(shù)，其中X將 Q映射為O。

• q0 is the initial start state from where any input starts getting processed (q0 ∈ Q).

  q0是初始開始狀態(tài)，從該狀態(tài)開始處理任何輸入(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機(jī)器和Moore機(jī)器之間的比較/差異 (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.

機(jī)器 摩爾機(jī)

輸出取決于當(dāng)前狀態(tài)和當(dāng)前輸入。	輸出僅取決于當(dāng)前狀態(tài)。
它的狀態(tài)少于摩爾機(jī)。	它的狀態(tài)比粉塵機(jī)還多。
它對輸入的React更快。	它對輸入的React較慢，因?yàn)樾枰嗟倪壿嫛?
在相同的時(shí)鐘周期內(nèi)。	有更多的電路延遲。
輸出放置在過渡上。	輸出放置在狀態(tài)上。
設(shè)計(jì)所需的硬件更少。	需要更多硬件。
如果輸入發(fā)生變化，則輸出也會發(fā)生變化。	如果輸入發(fā)生變化，則輸出不會發(fā)生變化。
設(shè)計(jì)非常困難。	這很容易設(shè)計(jì)。

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

moore和mealy

總結(jié)

以上是生活随笔為你收集整理的moore和mealy_Mealy机和Moore机的比较研究 目录的全部內(nèi)容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網(wǎng)站內(nèi)容還不錯(cuò)，歡迎將生活随笔推薦給好友。