Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
EUR 34,00
Cantidad disponible: 2 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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 + xy' ' represents the logical equation ' (NOT(x) AND y) OR (x AND NOT(y)) '). The dual canonical forms of any Boolean function are a 'sum of minterms' and a 'product of maxterms.' The term 'Sum of Products' or 'SoP' is widely used for the canonical form that is a disjunction (OR) of minterms. Its De Morgan dual is a 'Product of Sums' or 'PoS' for the canonical form that is a conjunction (AND) of maxterms. 80 pp. Englisch.
Librería: AHA-BUCH GmbH, Einbeck, Alemania
EUR 35,89
Cantidad disponible: 1 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - 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 + xy' ' represents the logical equation ' (NOT(x) AND y) OR (x AND NOT(y)) '). The dual canonical forms of any Boolean function are a 'sum of minterms' and a 'product of maxterms.' The term 'Sum of Products' or 'SoP' is widely used for the canonical form that is a disjunction (OR) of minterms. Its De Morgan dual is a 'Product of Sums' or 'PoS' for the canonical form that is a conjunction (AND) of maxterms.
Librería: preigu, Osnabrück, Alemania
EUR 109,85
Cantidad disponible: 5 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. Canonical Form (Boolean algebra) | Boolean Algebra (logic), Boolean Function, Canonical Form | Lambert M. Surhone (u. a.) | Taschenbuch | Englisch | 2026 | OmniScriptum | EAN 9786131174162 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu Print on Demand.
Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemania
EUR 136,00
Cantidad disponible: 1 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. This item is printed on demand - Print on Demand Titel. Neuware -Please note that the content of this book primarily consists of articlesavailable from Wikipedia or other free sources online. In Booleanalgebra, any Boolean function can be expressed in a canonical form usingthe dual concepts of minterms and maxterms. Minterms are called productsbecause they are the logical AND of a set of variables, and maxterms arecalled sums because they are the logical OR of a set of variables(further definition appears in the sections headed Minterms and Maxtermsbelow). These concepts are called duals because of theircomplementary-symmetry relationship as expressed by De Morgan's lawswhich 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 NOTthus ' x' ' represents ' NOT x ', the Boolean usage ' x'y + xy' 'represents the logical equation ' (NOT(x) AND y) OR (x AND NOT(y)) ').The dual canonical forms of any Boolean function are a 'sum of minterms'and a 'product of maxterms.' The term 'Sum of Products' or 'SoP' iswidely used for the canonical form that is a disjunction (OR) ofminterms. Its De Morgan dual is a 'Product of Sums' or 'PoS' for thecanonical form that is a conjunction (AND) of maxterms.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 80 pp. Englisch.