What is the most unambiguous digraph representation of NAND/NOR?

discrete-mathematics graph-theory finite-state-machine directed-graphs graph-isomorphism

Solution 1:

What you are trying to construct for the NAND/NOR operators is a state diagram, specifically one for a Moore machine. However, for all but the simplest machines, it is impossible to avoid specifying states or inputs. It was made possible for the NOT operator because its a unary operator, and thus the state and input coincide. Your first graph is ideal enough.

Related

Approximate a convolution as a sum of separable convolutions
html content renders in Iframe but not in div
How to read the variable value in AHK?
continuous function on weak topology
Intuitive understanding of oriented volume and trivectors
If $A,B$ are Hermitian, how to show that $\lambda_\max(AB^{-1}) =\max_{x\ne 0} \frac{x^*Ax}{x^*Bx}$ if A,B have only positive eigenvalues?
$ \sum_{x=1}^n {{n-1} \choose {x-1}} {N \choose x} = {{N+n-1}\choose n}$ [duplicate]
Recyclerview custom button is invalid on fragment click?
Does purescript spago has package scopes?
How to integrate SoundCloud in Ruby on Rails?
'exec user process caused: exec format error' in AWS Fargate Service
1D non-maximum suppression in Python/scipy