On synchronization of a deterministic finite automaton

A new method is proposed for directed search of vertuces in an implicitly specified tree of state change. The method can be used in computing the vertices of the tree without necessarily computing the intermediate vertices an route to the vertex from the root. Estimates are given which show the ratio of the number of actually computed and the checked vertices.