Abstract:
We construct a minimal automaton for an output-incomplete Moore automa-
ton. The approach is motivated by physical interpretation of seeing deterministic finite
automata as models for elementary particles. When compared to some classical methods
our minimal automaton is unique up to an isomorphism and preserves also the undefined
or unspecified behaviour of the original automaton.
