RECURSIVE TERNARY-BASED ALGORITHM FOR COMPUTING PRIME IMPLICANTS OF MULTI-OUTPUT BOOLEAN FUNCTIONS
The problem of computing the set of prime implicants to represent a Boolean function is a classical problem that is still considered a running problem for research because all known approaches have limitations. The article reviews existing methods for computing prime implicants and highlights their...
Main Authors: | Zaid Al-Wardi, Osama Al-Wardi |
---|---|
Format: | Article |
Language: | Arabic |
Published: |
Mustansiriyah University/College of Engineering
2023-05-01
|
Series: | Journal of Engineering and Sustainable Development |
Subjects: | |
Online Access: | https://jeasd.uomustansiriyah.edu.iq/index.php/jeasd/article/view/914 |
Similar Items
-
Boolean algebra for computer logic /
by: Ennes, Harold E., 1911-
Published: (1978) -
Boolean algebra with computer applications /
by: Williams, Gerald Earl, 1931-
Published: (1970) -
Boolean algebra /
by: 172189 Ward, Brice
Published: (1971) -
Boolean algebra /
by: Goodstein, R. L. (Reuben Louis)
Published: (1963) -
Boolean algebras /
by: 318802 Sikorski, Roman
Published: (1969)