A Sequential Solution to the Density Classification Task Using an Intermediate Alphabet
摘要
We present a sequential cellular automaton of radius \(\frac{1}{2}\) as a solution to the density classification task that makes use of an intermediate alphabet, and converges to a clean fixed point with no remaining auxiliary or intermediate information. We extend this solution to arbitrary finite alphabets and to configurations in higher dimensions.