Roots of N - Valued Switching Functions,

reportActive / Technical Report | Accession Number: ADP002350 | Need Help?

Abstract:

A root of order u of a transformation 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 q - ary,p- valued switching functions. Author

Author(s):
Reischer, C. ; Simovici, D. A.
Author Organization(s):
QUEBEC UNIV TROIS-RIVIERES DEPT DE MATHEMATIQUES
Supplementary Note:
This article is from 'Proceedings of the International Symposium on Multiple-Valued Logic (13th) Held at Kyoto, Japan on May 23-25, 1983,' AD-A136 457, p183-188.
Pagination:
0006

Security Markings

DOCUMENT & CONTEXTUAL SUMMARY

Distribution:
Approved For Public Release

RECORD

Collection: TR
Subject Terms
Joint Capability Areas:
JCA_6.1.3_Switching and Routing
Communities of Interest:
No COI(s) Identified
Descriptor(s):
*Switching circuits, *Square roots, *Algorithms, *Symposia, Boolean algebra, Set theory, Functions, Switching
Keyword(s):
Component Reports, Multiple valued logic, Roots(Mathematical), Transformations
Report Date:
1983 May 01