What is it called (from sections: carnot maps, minterns, simplification of schemes)?

R

R

RuslanSer2020-09-11 16:28:50

Mathematics

RuslanSer, 2020-09-11 16:28:50

What is it called (from sections: carnot maps, minterns, simplification of schemes)?

How does is called? I know that this is from the section of circuitry. I managed to solve 1 example using carnot maps
(where it’s just F), but I don’t know what !F(NOT F):

help!

Reply

Answer the question

Answer the question

In order to leave comments, you need to log in

1 answer(s)

R

Roman Mirilaczvili, 2020-09-11
@2ord

Boolean Algebra,
Minimization Methods for Boolean Functions

Similar questions

J

Jony13372016-09-19 20:52:57

How to create an algorithm for solving such a problem? 4Reply

K

kolomiec_artiom2019-02-19 18:30:31

Is there a universal algorithm for the problems 'Is it possible to shift 1 matchstick so that the equality becomes true'? 1Reply

W

white_sterx2019-02-23 12:30:17

What are some good Computing Application Architecture tutorials? 3Reply

B

Bogdan2019-02-26 17:53:48

Logarithmic scale? 1Reply

L

Lillixi2022-04-20 00:46:26

The relevance of the study of the logic of predicates? 3Reply

Didn't find what you were looking for?

Ask your question

Ask a Question

731 491 924 answers to any question