New Results on Reversible Boolean Functions Having Component Functions with Specified Properties

In the traditional logic synthesis different classifications of non-reversible Boolean functions have found many applications. Recently, some attempts to deal with classifications of reversible functions have been published. In this paper, solutions of two problems which have not been addressed yet are presented. The solutions were found by extrapolation of cycle structures for 3-and 4-variable reversible functions obtained in the course of enumerative computations.