DocumentCode
3090513
Title
On the implementation of set-valued non-Boolean switching functions
Author
Reischer, Corina ; Simovici, Dan A.
Author_Institution
Dept. of Math. & Comput. Sci., Quebec Univ., Trois-Rivieres, Que., Canada
fYear
1991
fDate
26-29 May 1991
Firstpage
166
Lastpage
172
Abstract
Biological computing based on the interactions between engines and substrate is addressed. An upper bound is given on the complexity of the bio-circuits that realize set-valued functions. This bound is based on an equivalence attached to a set-valued function such that the classes of the quotient set of the definition domain with respect to such an equivalence coincide with the maximal sets on which the function can be evaluated by computing a value of a Boolean function
Keywords
biomolecular electronics; many-valued logics; switching functions; Boolean function; bio-circuits; biological computing; definition domain; equivalence; maximal sets; nonBoolean switching functions; set-valued functions; Biochemistry; Biology computing; Boolean algebra; Boolean functions; Circuits; Computer science; Data processing; Logic; Mathematics; Upper bound;
fLanguage
English
Publisher
ieee
Conference_Titel
Multiple-Valued Logic, 1991., Proceedings of the Twenty-First International Symposium on
Conference_Location
Victoria, BC
Print_ISBN
0-8186-2145-1
Type
conf
DOI
10.1109/ISMVL.1991.130723
Filename
130723
Link To Document