Editing Moore machine (section)

====Worked example====
A sequential network has one input and one output. The output becomes 1 and remains 1 thereafter when at least two 0's and two 1's have occurred as inputs.

[[File:Moore Machine.svg|Example moore machine|thumb|upright=1.5|right|alt=Example moore machine]]

A Moore machine with nine states for the above description is shown on the right. The initial state is state A, and the final state is state I. The state table for this example is as follows:
{| class="wikitable" style="text-align: center"
|-
! Current state !! Input !! Next state !! Output
|-
| rowspan=2 | A || 0 || D || rowspan=2 | 0
|-
|                  1 || B
|-
| rowspan=2 | B || 0 || E || rowspan=2 | 0
|-
|                  1 || C
|-
| rowspan=2 | C || 0 || F || rowspan=2 | 0
|-
|                  1 || C
|-
| rowspan=2 | D || 0 || G || rowspan=2 | 0
|-
|                  1 || E
|-
| rowspan=2 | E || 0 || H || rowspan=2 | 0
|-
|                  1 || F
|-
| rowspan=2 | F || 0 || I || rowspan=2 | 0
|-
|                  1 || F
|-
| rowspan=2 | G || 0 || G || rowspan=2 | 0
|-
|                  1 || H
|-
| rowspan=2 | H || 0 || H || rowspan=2 |0
|-
|                  1 || I
|-
| rowspan=2 | I || 0 || I || rowspan=2 | 1
|-
|                  1 || I
|}