I know Quine–McCluskey algorithm for minimization of boolean functions. but there's this Petrick's method for determining the prime implicants that I need to know about. I've read some stuff about it but I didn't get it the way I should. can somebody please explain it in the simplest possible way?
I would be really grateful.
I would be really grateful.