On universality of general reversible multiple-valued logic gates

P. Kerntopf, M.A. Perkowski, M.H.A. Khan
Proceedings. 34th International Symposium on Multiple-Valued Logic  
A set of p-valued logic gates (primitives) is called universal if an arbitrary p-valued logic function can be realized by a logic circuit built up from a finite number of gates belonging to this set. In the paper, we consider the problem of determining the number of universal ternary reversible logic gates with two inputs and two outputs. We have established that over 97% of such gates are universal. Some of the theoretical results are also valid for arbitrary p-valued reversible logic gates.
doi:10.1109/ismvl.2004.1319922 dblp:conf/ismvl/KerntopfPK04 fatcat:xicytgwx6jcd5kufjxjigykrey