A characterization of Boolean collections of set-valued functions
References (8)
- et al.
Design of a highly parallel set logic network based on a bio-device model
- et al.
Design of interconnection-free biomolecular computing system
The lure of molecular computing
IEEE Spectrum
(1986)- M. Kameyama and T. Higuchi, Prospects of multiple-valued bio-information processing systems, in: Proc. 18th Symp....
Cited by (4)
Prominent classes of the most general subsumptive solutions of Boolean equations
2014, Information SciencesCitation Excerpt :Boolean transformations (functions from Bn to Bm expressed by m Boolean functions from Bn to B) [36–38,43]. A Boolean set (a subset of Bn characterized by a Boolean equation, viz., the set of particular solutions for such an equation) [32]. A main contribution of [44] is that it fills a gap in the process of characterization of subsumptive general solutions of a Boolean equation, which was earlier achieved via another concept called ‘recurrent cover’ [9].
Subsumptive general solutions and parametric general solutions of Post equations
2012, Information SciencesCitation Excerpt :Post equations were studied by Epstein [8], Carvallo [7], Bordat [5], Beazer [4], Serfati [14–16], Banković [1–3], Rudeanu [11] and other authors. Many theorems from this field represent generalizations of the corresponding result for Boolean functions and equations ([6], [9], [10] and [12]). Rudeanu [13] determined the most general form of the subsumptive general solution of a Boolean equation.
Boolean sets and most general solutions of Boolean equations
2010, Information SciencesBoolean completeness in multiple-valued set logic
2003, Journal of Multiple-Valued Logic and Soft Computing