T
T
Therapyx2015-10-26 04:47:19
Electronics
Therapyx, 2015-10-26 04:47:19

DNF, CNF, Minimal form. How to solve problems of this kind?

Good night, toaster, I should probably apologize for this kind of question, but unfortunately I missed the lecture and I can’t understand all the tasks And I can’t find information on the Internet for this particular task.
- It is necessary to "define DNF, KNF and the minimum form from p (x, y, z)"
f55c0e1000604d29ae47bd9fb76fadd4.png
This is not homework for any tests. It is just very important to understand how it is solved. I find on the Internet only with the basic operators V, ^, ! and tables where DNF = all units. KNF = all zeros. But as I understood the task, here it is necessary to prove without any tables.
- I would be glad not so much for a solution, but for an explanation with all sorts of nuances (clear articles on the Internet in exactly the same style as it is in the picture).
ps we have everything in German, so in Russian it makes the search very difficult :)

Answer the question

In order to leave comments, you need to log in

1 answer(s)
A
aol-nnov, 2015-10-26
@aol-nnov

Wikipedia is well written on this subject with examples of solutions.
you will also need the de Morgan formula

Didn't find what you were looking for?

Ask your question

Ask a Question

731 491 924 answers to any question