The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
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.