# Recent questions tagged minimization 1
f(A,B,C,D)=∏M(0,1,3,4,5,7,9,11,12,13,14,15) is a max-term representation of a Boolean function f(A,B,C,D) where A is the MSB and D is the LSB. The equivalent minimized representation of this function is (A+C¯+D)(A¯+B+D)(A+C¯+D)(A¯+B+D) AC¯D+A¯BD+A¯BC A¯CD¯+AB¯CD¯+AB¯C¯D¯ (B+C¯+D)(A+B¯+C¯+D)(A¯+B+C+D)
2
Is there any relationship between Irredundant or Irreducable expression with minimal expression??? I mean can we say like “every irredundant is minimal” or “every minimal is irredundant” or “some expressions which are both minimal & Irredundant”
3
Give an example of DFA minimization where the initial state is final state and there are one or more final states
4
A certain 4 input gate called LEMON gate realizes the switching function LEMON(A,B,C,D) = BC(A+D) Assuming that the input variables are available in both primed and unprimed form: i. show a realization of the function f(w,x,y,z)= P(0,1,6,9,10,11,14,15) with only three LEMON gates and one OR gate.
5
6
No of PRIME IMPLICANTS ??
7
8
9
How many number of false essential prime implicants for the given Boolean functions f(A,B,C) = $\sum{m(0,3,7)}.$
10
1 vote
11
Let there are 12 minterms in a function in which 8 minterms are covered by 2 Essential Prime Implicants. Each of the remaining 4 minterms have 2 Non- Essential Prime Implicants. Then the total number of minimal expressions is Answer is 16. Can anyone provide the solution to this problem.
1 vote