ON VARIETY SEPARABILITY OF SUBSETS OF A MONOID, WITH APPLICATIONS TO FINITE AUTOMATA

摘要

In several publications, see [3] and [8], procedures are given for reducing the number of states of an incompletely specified finite automaton without changing its input-output characteristics insofar as these are specified. These procedures are related to the structure of the monoid of the automaton, that is, the monoid of transformations of the states determined by the transition function.