A Note on State Minimization of a Special Class of Incomplete Sequential Machines

In this note a necessary and sufficient condition is supplied for a flow table to have the property that every cover composed of maximal compatibles is closed. An example of such a flow table is given to which all sufficient conditions known before do not apply.