Canonical Form (Boolean algebra)
Lambert M. Surhone, Miriam T. Timpledon, Susan F. Marseken
High Quality Content by WIKIPEDIA articles! In Boolean algebra, any Boolean function can be expressed in a canonical form using the dual concepts of minterms and maxterms. Minterms are called products because they are the logical AND of a set of variables, and maxterms are called sums because they are the logical OR of a set of variables (further definition appears in the sections headed Minterms and Maxterms below). These concepts are called duals because of their complementary-symmetry relationship as expressed by De Morgan's laws, which state that AND(x,y,z,...) = NOR(x',y',z',...) and OR(x,y,z,...) = NAND(x',y',z',...) (the apostrophe ' is an abbreviation for logical NOT, thus " x' " represents " NOT x ", the Boolean usage " x'y +...
ISBN: 978-6-1311-7416-2
Издательство:
Книга по требованию
Дата выхода: июль 2011