constructive mathematics, realizability, computability
propositions as types, proofs as programs, computational trinitarianism
Moore machines are a special type of finite state automata and in particular a special case of Mealy machines (see there for more).
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
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.
Mark V. Lawson, Finite automata, CRC Press, see also here for a shorter version in the form of Course Notes.
Guido Boccali, Bojana Femić, Andrea Laretto, Fosco Loregian, Stefano Luneia, The semibicategory of Moore automata (arXiv:2305.00272)
Last revised on August 25, 2023 at 11:54:46. See the history of this page for a list of all contributions to it.