This paper deals with the reversible circuits with n input and
output nodes, consisting of the reversible gates FAN-IN=FAN-OUT<3.
We define a normal form of such type of circuits and describe a reduction
algorithm to transform a circuit in this form. Furthermore we use it for
checking whether two circuits ... more >>>

A Boolean-weighted graph is a finite graph whose edges carry DNF formulas over a common variable set. This paper studies two isomorphism problems on such graphs, distinguished by whether the per-edge condition requires the matched edge labels to be syntactically DNF-isomorphic (BWG-ISO) or syntactically DNF non-isomorphic (BWG-NI), each over a ... more >>>