Show simple item record

dc.contributor.authorKang, Andy N. C.en_US
dc.contributor.authorShen, Stewart N.T.en_US
dc.date.accessioned2013-06-19T14:36:50Z
dc.date.available2013-06-19T14:36:50Z
dc.date.issued1974
dc.identifierhttp://eprints.cs.vt.edu/archive/00000761/en_US
dc.identifier.urihttp://hdl.handle.net/10919/20253
dc.description.abstractIn this paper, the definability of functions over B_s is first briefly discussed. We then give necessary and sufficient conditions on the definable functions over B_2, boolean algebra of four values. An efficient algorithm is also presented for finding the defining boolean expressions for the definable functions over B_2, The result is then extended to the functions over B_s.en_US
dc.format.mimetypeapplication/pdfen_US
dc.publisherDepartment of Computer Science, Virginia Polytechnic Institute & State Universityen_US
dc.relation.ispartofHistorical Collection(Till Dec 2001)en_US
dc.titleDefinability of Boolean Function Over Many-value Boolean Algebraen_US
dc.typeTechnical reporten_US
dc.identifier.trnumberCS74007-Ren_US
dc.type.dcmitypeTexten_US
dc.identifier.sourceurlhttp://eprints.cs.vt.edu/archive/00000761/01/CS74007-R.pdf


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record