Finite state machine: Difference between revisions
From Rice Wiki
No edit summary |
No edit summary |
||
| Line 4: | Line 4: | ||
In contrast, in a '''Mealy circuit''', input is also wired into the output logic. This is visualized by existence of output on each edge in a state diagram. | In contrast, in a '''Mealy circuit''', input is also wired into the output logic. This is visualized by existence of output on each edge in a state diagram. | ||
A Moore machine is ''synchronous'', whereas a Mealy machine is ''asynchronous''. This is because the input is wired into a Mealy machine's output combinational circuit along with the current state. | |||
[[Category:Computer Architecture]] | [[Category:Computer Architecture]] | ||
Latest revision as of 06:47, 7 June 2024
The state of the program is its memory. A finite state machine continuously computes the current state with the previous state based on a function.
In a Moore circuit, output only depends on the current state. This is visualized by existence of output on each state node in a state diagram.
In contrast, in a Mealy circuit, input is also wired into the output logic. This is visualized by existence of output on each edge in a state diagram.
A Moore machine is synchronous, whereas a Mealy machine is asynchronous. This is because the input is wired into a Mealy machine's output combinational circuit along with the current state.
