A NOR gate with both inputs tied together — circuit to expression

corereads back as Ā

Answer

A′ (output column 10)

Why this example is worth doing

One gate, both inputs shorted to the same signal, which is the cheapest inverter you can build from a NOR and the first move in every NOR-only conversion. The expression reader has to handle a fan-out node driving two inputs of the same gate, which is exactly the case a two-terminal wire model gets wrong. The page notes the tying-versus-grounding choice too: A NOR 0 also inverts, and which one a real design uses depends on the library, not the algebra.

Try your own input in the Logic circuit → expression. Wire up gates and read the Boolean expression and truth table back out.

How the answer is reached

Gate list

Gate list — columns Node, Gate, Inputs
NodeGateInputs
g1norA, A

Quine–McCluskey

Prime implicants — Quine–McCluskey
#Term
1A′
Minimum cover — Quine–McCluskey
#Cover
1A′
Warning:

1 term(s), 1 literal(s); 1 essential prime implicant(s).

Truth table

Truth table — columns #, A, F
#AF
001
110

Compare with

Open the Logic circuit → expression

This input is entered in the tool itself — it is too rich for a link to carry.

Note:

Notation this page assumes

  • Symbols: · is AND, + is OR, ⊕ is XOR, a prime or an overline is NOT. The field also takes ∧ ∨ ¬ ~ ! & | and the words.
  • Operator precedence, tightest first: NOT, then AND (including juxtaposition), then XOR/XNOR, then NAND/NOR, then OR, then IMPLIES, then IFF.
  • Gate symbols follow whichever standard the header toggle is set to: ANSI/IEEE Std 91-1984 distinctive shapes, or IEC 60617-12 rectangles.

Sources

  • Shannon, “A Symbolic Analysis of Relay and Switching Circuits” (1938)
  • ANSI/IEEE Std 91-1984, Graphic Symbols for Logic Functions