Towards an algebraic theory of Boolean circuits. (Q1410965): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Higher-dimensional word problems with applications to equational logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3138543 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new finiteness condition for monoids presented by complete rewriting systems (after Craig C. Squier) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Church-Rooser property and homology of monoids / rank
 
Normal rank
Property / cites work
 
Property / cites work: FUNCTORIAL SEMANTICS OF ALGEBRAIC THEORIES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5639839 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimality of the system of seven equations for the category of finite sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Word problems and a homological finiteness condition for monoids / rank
 
Normal rank
Property / cites work
 
Property / cites work: A finiteness condition for rewriting systems / rank
 
Normal rank

Latest revision as of 11:53, 6 June 2024

scientific article
Language Label Description Also known as
English
Towards an algebraic theory of Boolean circuits.
scientific article

    Statements

    Towards an algebraic theory of Boolean circuits. (English)
    0 references
    0 references
    15 October 2003
    0 references
    Logical gates are considered as generators for an algebraic structure of circuits with sequential and parallel compositions of gates. Circuits made up of logical gates are considered as diagrams and are analyzed by using knot theory. To analyze diagrams, a canonical form and rewriting systems are introduced. A typical theorem in this work has the form: The generators \(a\), \(b\), \(c\) and the relations \(d\), \(f\), \(g\) form a presentation of the monoidal subcategory \(H\).
    0 references
    Boolean circuit
    0 references
    knot theory
    0 references
    canonical form
    0 references
    rewriting system
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references