  We show that a well-known family of deterministic finite automata can be used
to distinguish distinct binary strings of the same length from every start
state. Further, we establish almost matching lower and upper bounds on the
number of states of such automata necessary to achieve this type of separation.
Our result improves the currently best known linear upper bound for arbitrary
DFA.
