### Abstract

It is known that any switching function can be written as a totally symmetric function with some of its variables being repetitive. In this note, the least upper bound for the number of variables of the transformed totally symmetric functions based on the partition on the set of variables induced by the partial symmetry of the given switching function is found, and a technique for obtaining a transformed totally symmetric function with the number of variables equal to the least upper bound is given.

Original language | English (US) |
---|---|

Pages (from-to) | 1606-1609 |

Number of pages | 4 |

Journal | IEEE Transactions on Computers |

Volume | C-20 |

Issue number | 12 |

DOIs | |

State | Published - Dec 1971 |

Externally published | Yes |

### Keywords

- Least upper bound
- switching functions
- technique
- totally symmetric functions
- transformation

### ASJC Scopus subject areas

- Software
- Theoretical Computer Science
- Hardware and Architecture
- Computational Theory and Mathematics

## Fingerprint Dive into the research topics of 'Transformation of an Arbitrary Switching Function to a Totally Symmetric Function'. Together they form a unique fingerprint.

## Cite this

Yau, S. S., & Tang, Y. S. (1971). Transformation of an Arbitrary Switching Function to a Totally Symmetric Function.

*IEEE Transactions on Computers*,*C-20*(12), 1606-1609. https://doi.org/10.1109/T-C.1971.223182