Leader election on two-dimensional periodic cellular automata
Two-dimensional cellular automata on states periodic in two directions (that is, on a finite torus) are studied from the viewpoint of computational power. A selection problem (`leader election') is defined, and an algorithm is presented to solve this problem. Other uses of the algorithm, and possible extensions to higher dimensions, are discussed.
scientific article; zbMATH DE number 6668316