Abstract
A method of finding the shortest transfer sequence for the given set of internal states with using operations on ROBDDs is considered. Simplified ROBDDs for transition functions compositions are applied. The ROBDDs are built by using Shannon decomposition first for state and then for input variables. In the simplified ROBDD its path originated by state variables has the only prolongation among input variables. An algorithm of cutting the number of these prolongations for the ROBDD is proposed. The algorithm is based on using the decomposition tree and oriented to cut calculations on finding the shortest transfer sequence.