Book chapter
ON COMPLETENESS OF A SET OF AMBIGUOUS LOGIC PRIMITIVES
Theory of Machines and Computations, pp.387-394
Elsevier Inc
1971
DOI: 10.1016/B978-0-12-417750-5.50038-5
Abstract
A logic primitive is said to be ambiguous if for some input configurations, the output of the primitive is not definitely specified. This paper is concerned with the problem of building switching circuits for arbitrary switching functions by using a set of ambiguous logic primitives. A set of necessary conditions and a set of sufficient conditions for a set of ambiguous logic primitives to be complete, are given.
Details
- Title: Subtitle
- ON COMPLETENESS OF A SET OF AMBIGUOUS LOGIC PRIMITIVES
- Creators
- Amar Mukhopadhyay - Department of Computer ScienceSudhakar M Reddy - University of Iowa
- Resource Type
- Book chapter
- Publication Details
- Theory of Machines and Computations, pp.387-394
- DOI
- 10.1016/B978-0-12-417750-5.50038-5
- Publisher
- Elsevier Inc
- Language
- English
- Date published
- 1971
- Academic Unit
- Electrical and Computer Engineering
- Record Identifier
- 9984197921002771
Metrics
8 Record Views