Pattern synchronization in two-dimensional cellular spaces

Abstract

This paper presents an algorithm for synchronizing (firing) an arbitrary, finite, connected pattern of cells in a potentially infinite two-dimensional grid of identical finite state cells. Earlier solution times have been quadratic in m, where m is the edge length of the smallest square enclosing the pattern. A linear solution is formulated