If I had two functions, where each letter represents a state:
- f(1) = CD + AB
- f(2) = AC + AD + BC
How could I find the minimum term that would need to be added to the second function to make the functions equivalent using Karnaugh maps?
I know how to minimise functions with Karnaugh maps, but this question has confused me.
What you are saying is, that you are trying to find a function $f(3)$ (although this is a rather awkward notation for functions) such that
$$f(2) + f(3) = f(1)$$
or in other words you are searching
$$f(3) = f(1) + f(2) = CD + AB + AC+AD+BC$$
(the + there is the same as a -, since we are working with booleans) Now you should know how to minimize the right hand side.