Division Algorithm for Cellular Automata Rules
Burton Voorhees
Faculty of Science, Athabasca University,
Box 10,000 Athabasca (AB), Canada T0G 2R0
Abstract
Given two cellular automata rules represented as operators Q and X, together with certain natural restrictions on their neighborhood structures, an algorithm is provided which yields two other rules, A and R, such that Q = AX + R. A generalized arithmetic of residues follows from this.
