An outer-totalistic cellular automaton is a generalization of the totalistic cellular automaton. Totalistic rules are a proper superset of outer-totalistic rules. In particular, consider the cellular automaton rule a b c d so that the center cell with value b changes to value d when bordered by cells with values a and c. The cells with values a and c are called the outer cells. In a totalistic cellular automatic, the total value of the cells a + b + c (0<=a + b + c<=3(k - 1)) is considered, and for each possible value of that total, the rule output is given. So a list of 3(k - 1) + 1 entries, each from 0 to k - 1 are needed.

cellular automaton | totalistic cellular automaton