This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Transformation of Ternary Switching Functions to Completely Symmetric Ternary Switching Functions
June 1969 (vol. 18 no. 6)
pp. 559-560
R.C. Born, IEEE
It is shown that any ternary switching function can be transformed to a completely symmetric ternary switching function in which some of the variables are repeated. The partial symmetry information inherent in a given function plays a key role in this transformation.
Index Terms:
Combinational logic, switching theory, symmetric ternary switching functions, ternary logic.
Citation:
R.C. Born, "Transformation of Ternary Switching Functions to Completely Symmetric Ternary Switching Functions," IEEE Transactions on Computers, vol. 18, no. 6, pp. 559-560, June 1969, doi:10.1109/T-C.1969.222711
Usage of this product signifies your acceptance of the Terms of Use.