Finite state machine: Difference between revisions
From Rice Wiki
(Created page with "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. In contrast, in a ''Mealy circuit''', input is also wired into the output logic. Category:Computer Architecture") |
No edit summary |
||
| Line 1: | Line 1: | ||
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. | 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. | 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. | 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. | ||
[[Category:Computer Architecture]] | [[Category:Computer Architecture]] | ||
Revision as of 06:33, 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.
