Detection of Totally Symmetric Boolean Functions
- 1 December 1965
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Electronic Computers
- Vol. EC-14 (6) , 924-926
- https://doi.org/10.1109/PGEC.1965.264089
Abstract
A new method for detection and identification of totally symmetric Boolean functions is developed. Instead of using maps, charts, or truth tables, with permutations and complementations of variables, this method is based on the number of vertices contained in symmetric functions and the concept of distance between two vertices. Since the distance between any two vertices remains invariant under any number of permutations and complementations of the variables, this method lends itself equally conveniently to the detection of total symmetry of Boolean functions with respect to purely uncomplemented, purely complemented, or mixed variables. A procedure is presented, and an example is worked out to illustrate the application of the method.Keywords
This publication has 5 references indexed in Scilit:
- Detection of Total or Partial Symmetry of a Switching Function with the Use of Decomposition ChartsIEEE Transactions on Electronic Computers, 1963
- Algebraic Properties of Symmetric and Partially Symmetric Boolean FunctionsIEEE Transactions on Electronic Computers, 1963
- The Detection and Identification of Symmetric Switching Functions with the Use of Tables of CombinationsIEEE Transactions on Electronic Computers, 1956
- Detection of Group Invariance or Total Symmetry of a Boolean Function*Bell System Technical Journal, 1956
- The recognition and identification of symmetric switching functionsTransactions of the American Institute of Electrical Engineers, Part I: Communication and Electronics, 1954