2011 41st IEEE International Symposium on Multiple-Valued Logic 2011
DOI: 10.1109/ismvl.2011.23
|View full text |Cite
|
Sign up to set email alerts
|

Classification of Ternary Logic Functions by Self-Dual Equivalence Classes

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
5
0

Year Published

2013
2013
2015
2015

Publication Types

Select...
3

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(5 citation statements)
references
References 8 publications
0
5
0
Order By: Relevance
“…A brute force search shows that there can be MDDs with 29 different shapes [12]. For n = 3 and n = 4, there are 982205208 and 2376042139520266057185384126838871 ∼ 2 · 10 33 classes out of approximately 7.6·10 12 and 4.4·10 38 functions [8]. We conjecture that the number of different shapes of MDDs will be considerably smaller, since an MDD of the given shape can represent many functions as can be seen from the following example.…”
Section: Beads and Classification Of Ternary Functions In Terms Omentioning
confidence: 97%
See 2 more Smart Citations
“…A brute force search shows that there can be MDDs with 29 different shapes [12]. For n = 3 and n = 4, there are 982205208 and 2376042139520266057185384126838871 ∼ 2 · 10 33 classes out of approximately 7.6·10 12 and 4.4·10 38 functions [8]. We conjecture that the number of different shapes of MDDs will be considerably smaller, since an MDD of the given shape can represent many functions as can be seen from the following example.…”
Section: Beads and Classification Of Ternary Functions In Terms Omentioning
confidence: 97%
“…In [8], proposed are three classifications of ternary functions. The strongest among them in terms of the number of different classes, the NP S-classification, is defined by the analogy to the NP N-classification of binary functions.…”
Section: Beads and Classification Of Ternary Functions In Terms Omentioning
confidence: 99%
See 1 more Smart Citation
“…An extension of the NPN classification of binary logic functions places the 19,683 different two-input, one-output ternary logic functions into 84 different equivalence classes [13,14] by still allowing the order of the inputs to be The 84 canonical logic functions with two inputs and one output which represent each of the 84 equivalence classes in this type of logic function. These functions can be transformed under the equivalences described in Appendix A to produce all 19,683 functions of this type.…”
Section: Ternary Logicmentioning
confidence: 99%
“…These functions can be transformed under the equivalences described in Appendix A to produce all 19,683 functions of this type. Each class is numbered based on the order found in previous classifications [13,14]. The number of functions present in each class is given following the class number.…”
Section: Ternary Logicmentioning
confidence: 99%