Editing Moore machine (section)

==Examples==
Types according to number of inputs/outputs.

===Simple===

Simple Moore machines have one input and one output:
* [[Edge detection|edge detector]] using [[XOR]]
* [[wikibooks:Fractals/Mathematics/group/Binary adding machine|binary adding machine]]
* [[Clocked sequential system#Clocked sequential system|clocked sequential systems]] (a restricted form of Moore machine where the state changes only when the global clock signal changes)

Most digital electronic systems are designed as [[Clocked sequential system#Clocked sequential system|clocked sequential systems]]. Clocked sequential systems are a restricted form of Moore machine where the state changes only when the global clock signal changes. Typically the current state is stored in [[Flip-flop (electronics)|flip-flops]], and a global clock signal is connected to the "clock" input of the flip-flops. Clocked sequential systems are one way to solve [[Metastability in electronics|metastability]] problems. A typical electronic Moore machine includes a [[combinational logic]] chain to decode the current state into the outputs (lambda). The instant the current state changes, those changes ripple through that chain, and almost instantaneously the output gets updated. There are design techniques to ensure that no [[glitch]]es occur on the outputs during that brief period while those changes are rippling through the chain, but most systems are designed so that glitches during that brief transition time are ignored or are irrelevant. The outputs then stay the same indefinitely ([[LED]]s stay bright, power stays connected to the motors, [[solenoid]]s stay energized, etc.), until the Moore machine changes state again.

[[File:Moore-Automat-en.svg|center|alt=alt text|Moore machine in combinational logic]]

====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
|}

===Complex===
More complex Moore machines can have multiple inputs as well as multiple outputs.