Canonical normal form
In Boolean algebra, any Boolean function can be put into the canonical disjunctive normal form (CDNF) or minterm canonical form and its dual canonical conjunctive normal form (CCNF) or maxterm canonical form. Other canonical forms include the complete sum of prime implicants or Blake canonical form (and its dual), and the algebraic normal form (also called Zhegalkin or Reed–Muller).
Wikipage disambiguates
Boolean normal formCanonical conjunctive normal formCanonical disjunctive normal formCanonical form (Boolean algebra)Max-termMaxtermMaxterm canonical formMaxtermsMin-termMinimal POSMinimal SOPMintermMinterm canonical formMintermsNormal form (Boolean algebra)Product-Of-SumsProduct-of-sumsProduct of SumsProduct of sumsSum-Of-ProductsSum-of-productsSum of ProductsSum of products
Wikipage redirect
Algebraic normal formAlgorithmic state machineAnd-inverter graphBackus–Naur formBoole's expansion theoremBoolean algebra (structure)Boolean functionBoolean normal formBurroughs B1700CCNFCDNFCanonical conjunctive normal formCanonical disjunctive normal formCanonical form (Boolean algebra)Computable topologyConjunctive normal formDisjunctive normal formEspresso heuristic logic minimizerField-programmable gate arrayGajski-Kuhn chartIndex of logic articlesIndex of philosophy articles (A–C)Karnaugh mapList of Boolean algebra topicsLogic optimizationMax-termMaxtermMaxterm canonical formMaxtermsMin-termMinimal POSMinimal SOPMintermMinterm canonical formMintermsNormal formNormal form (Boolean algebra)Original Chip SetOutline of logicPOS
Link from a Wikipage to another Wikipage
primaryTopic
Canonical normal form
In Boolean algebra, any Boolean function can be put into the canonical disjunctive normal form (CDNF) or minterm canonical form and its dual canonical conjunctive normal form (CCNF) or maxterm canonical form. Other canonical forms include the complete sum of prime implicants or Blake canonical form (and its dual), and the algebraic normal form (also called Zhegalkin or Reed–Muller).
has abstract
En Álgebra booleana, se conoce ...... ción lógica (AND) de maxterms.
@es
En àlgebra booleana, es coneix ...... nció lògica (AND) de maxterms.
@ca
In Boolean algebra, any Boolea ...... igital circuits in particular.
@en
La forma canonica, o forma nor ...... sando la tabella della verità:
@it
Na álgebra Booleana, qualquer ...... ipalmente, circuitos digitais.
@pt
يوجد شكلان عأديان للجبر المنطقي: 1.
* مجموع المضاريب: 2.
* مضروب المجاميع:
@ar
布尔代数中，由标准逻辑运算符组成的布尔函数可以按利用了对偶性“极小项”和“极大项”的概念的规范形式来表达。
@zh
Link from a Wikipage to an external page
Wikipage page ID
page length (characters) of wiki page
Wikipage revision ID
1,009,567,247
Link from a Wikipage to another Wikipage
cs1-dates
y
@en
date
April 2020
@en
wikiPageUsesTemplate
comment
En Álgebra booleana, se conoce ...... zación de circuitos digitales.
@es
En àlgebra booleana, es coneix ...... mització de circuits digitals.
@ca
In Boolean algebra, any Boolea ...... led Zhegalkin or Reed–Muller).
@en
La forma canonica, o forma nor ...... sando la tabella della verità:
@it
Na álgebra Booleana, qualquer ...... forma normal de Reed–Muller).
@pt
يوجد شكلان عأديان للجبر المنطقي: 1.
* مجموع المضاريب: 2.
* مضروب المجاميع:
@ar
布尔代数中，由标准逻辑运算符组成的布尔函数可以按利用了对偶性“极小项”和“极大项”的概念的规范形式来表达。
@zh
label
Canonical normal form
@en
Forma canonica (algebra di Boole)
@it
Forma canònica (àlgebra de Boole)
@ca
Forma normal canônica
@pt
Formas canónicas (álgebra de Boole)
@es
Kanonische Normalform
@de
الأشكال العادية للجبر المنطقي
@ar
规范形式 (布尔代数)
@zh