Rule expressions [for cellular automata]
The table below gives Boolean expressions for each of the elementary rules. The expressions use the minimum possible number of operators; when there are several equivalent forms, I give the most uniform and symmetrical one. Note that ⊻ stands for Xor.
![Rule expressions [for cellular automata] image 1](/nks/notes/notes-3-2--rule-expressions-for-cellular-automata/fig-a.png)