The existence and length of synchronizing and distinguishing sequences

A new way of looking at the state identification problem of finite-stale machines is proposed. This method uses exclusively equivalences defined on the state set. Two algorithms are derived for determining the existence of, respectively, synchronizing and distinguishing sequences. An upper bound on the length of synchronizing sequences is proved and an upper bound on the length of distinguishing sequences is conjectured.