Automatic programming of cellular automata: identification approach
Andrew Adamatzky · Kybernetes · 1997
To program cellular automata is to define cell neighbourhood and cell‐state transition rules in order to design an automation which exhibits determined patterns in its evolution or which transforms a given image into another image. In general, a tool for the automatic programming of cellular automata should translate the tuple (source‐configuration) → (target‐configuration) into a set of cell‐state transition rules. This is a problem which has not been completely solved yet. Attempts to show examples of automatic programming of cellular automata using identification algorithms. Results obtained can be used in the design of massively parallel processors with cellular‐automata architecture and a conventional, as well as non‐traditional (e.g. molecular and chemical), elementary base.