Contents

# Contents

## Idea

A Moore machine is a particular type of finite state automaton.

## Definition

A finite Moore machine, $\mathbf{A}$, consists of

• $Q$, a finite set of states;

• $A$, an input alphabet;

• $B$, an output alphabet;

• $q_0$, an initial state;

• $\delta: Q\times A\to Q$, a transition function;

and

• $\lambda:Q\to B$, the state output function.

These determine an output response function, $\omega_\mathbf{A}:A^*\to B^*$ and a characteristic function $\chi_\mathbf{A}:A^*\to B$ that picks out the language recognised by the machine.

Here we have, as usual, denoted by $A^*$ the free monoid (of all strings of symbols) over the ‘alphabet’ $A$, etc.

## References

Last revised on July 18, 2019 at 09:32:56. See the history of this page for a list of all contributions to it.