Roots of Nvalued switching functions
Abstract
A root of order u of a transformtion f of a finite set is a transformation of this set which iterated for u times gives f. The existence of such roots is discussed. The paper offers a new insight on the existence of square roots of Boolean functions as well as an algorithm for extracting the roots of g  ary,p valued switching functions.
 Publication:

The 13th Intern. Symp. on MultipleValued Logic
 Pub Date:
 1983
 Bibcode:
 1983mvl..symp..183R
 Keywords:

 Boolean Functions;
 Set Theory;
 Switching Circuits;
 Algorithms;
 Iteration;
 Switching Theory;
 Transformations (Mathematics);
 Electronics and Electrical Engineering