Transformation of an Arbitrary Switching Function to a Totally Symmetric Function

S. S. Yau; Y. S. Tang

doi:10.1109/T-C.1971.223182

Transformation of an Arbitrary Switching Function to a Totally Symmetric Function

Research output: Contribution to journal › Article › peer-review

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	https://doi.org/10.1109/T-C.1971.223182
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

Access to Document

10.1109/T-C.1971.223182

Cite this

@article{b8a1288e3f564114b22a2930da5bc5a2,

title = "Transformation of an Arbitrary Switching Function to a Totally Symmetric Function",

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.",

keywords = "Least upper bound, switching functions, technique, totally symmetric functions, transformation",

author = "Yau, {S. S.} and Tang, {Y. S.}",

year = "1971",

month = dec,

doi = "10.1109/T-C.1971.223182",

language = "English (US)",

volume = "C-20",

pages = "1606--1609",

journal = "IEEE Transactions on Computers",

issn = "0018-9340",

publisher = "IEEE Computer Society",

number = "12",

}

TY - JOUR

T1 - Transformation of an Arbitrary Switching Function to a Totally Symmetric Function

AU - Yau, S. S.

AU - Tang, Y. S.

PY - 1971/12

Y1 - 1971/12

N2 - 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.

AB - 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.

KW - Least upper bound

KW - switching functions

KW - technique

KW - totally symmetric functions

KW - transformation

UR - http://www.scopus.com/inward/record.url?scp=0015202610&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0015202610&partnerID=8YFLogxK

U2 - 10.1109/T-C.1971.223182

DO - 10.1109/T-C.1971.223182

M3 - Article

AN - SCOPUS:0015202610

SN - 0018-9340

VL - C-20

SP - 1606

EP - 1609

JO - IEEE Transactions on Computers

JF - IEEE Transactions on Computers

IS - 12

ER -

Transformation of an Arbitrary Switching Function to a Totally Symmetric Function

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this