The least upper bound of n(n−1)/2 input symbols is derived for the total length of characterizing sequences for a reduced n-state machine. When a machine can be characterized by a set of r ...