Observation on the construction of c sets in incompletely specified state tables

In a recent paper by Bennetts, Wahington and Lewin that was concerned with the reduction of the number of states in a sequential state table, a short cut, based on a theorem concerning nontransitive relationships, was proposed. This note generalises the theorem, and asks whether this more general form has any applications to state-table-reduction techniques.