Isbn: 9786131174162 - canonical form (boolean algebra): boolean algebra (logic), boolean function, canonical form (4 risultati)

Perfeziona la tua ricerca

  • Libri (4)

  • Nuovo (4)

  • Con foto (4)

a

Fascia di prezzo personalizzata (EUR)

a

    • Lingua: Inglese

      Editore: Omniscriptum Mär 2026, 2026

      6131174164 / 9786131174162

      • Brossura
      • Print on Demand

      Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, GermaniaBuchWeltWeit Ludwig Meier e.K.

      Venditore con 5 stelle
      Contatta il venditore

      Condizione: Nuovo

      EUR 34,00

      EUR 23,00 spedizione 
      Spedito da Germania a U.S.A.

      Quantità: 2 disponibili

      Taschenbuch. Condizione: 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.

    • Lingua: Inglese

      Editore: OmniScriptum, 2026

      6131174164 / 9786131174162

      • Brossura
      • Print on Demand

      Da: preigu, Osnabrück, Germaniapreigu

      Venditore con 5 stelle
      Contatta il venditore

      Condizione: Nuovo

      EUR 109,85

      EUR 70,00 spedizione 
      Spedito da Germania a U.S.A.

      Quantità: 5 disponibili

      Taschenbuch. Condizione: 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.

    • Lingua: Inglese

      Editore: Omniscriptum Mär 2026, 2026

      6131174164 / 9786131174162

      • Brossura
      • Print on Demand

      Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germaniabuchversandmimpf2000

      Venditore con 5 stelle
      Contatta il venditore

      Condizione: Nuovo

      EUR 136,00

      EUR 60,00 spedizione 
      Spedito da Germania a U.S.A.

      Quantità: 1 disponibili

      Taschenbuch. Condizione: 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.

    • Lingua: Inglese

      Editore: Omniscriptum, 2010

      6131174164 / 9786131174162

      • Brossura
      • Print on Demand

      Da: AHA-BUCH GmbH, Einbeck, GermaniaAHA-BUCH GmbH

      Venditore con 5 stelle
      Contatta il venditore

      Condizione: Nuovo

      EUR 189,66

      EUR 30,50 spedizione 
      Spedito da Germania a U.S.A.

      Quantità: 1 disponibili

      Taschenbuch. Condizione: 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.