Abstract
Cellular automata produce spatial patterns when specific rules for time development are given. This paper deals with an inverse problem of identifying the rules for spatial patterns given. Although only rules of one-dimensional elementary cellular automata and one-dimensional probabilistic cellular automata have shown here, the system can deal with two-dimensional one. When the rule identification has not been fully successful due to the lack of information in the spatial pattern, the system is able to give an identifiable part of the rules with a format of Wolfram’s rule number.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.References
von Neumann JJ (1966) Theory of Self-Reproducing Automata. edited and completed by Burks A, University of Illinois Press, Champaign, IL
Wolfram S (1984) Universality and Complexity in Cellular Automata. Physica D 10:1–35
Packard N, Wolfram S (1985) Two-dimensional cellular automata. J Statistical Physics 38:901–946
Langton CG (1992) Life at the edge of chaos. In: Artificial Life II, Santa Fe Institute Studies in the Sciences of Complexity, 10:41–91
Domany E, Kinzel W (1984) Equivalence of cellular automata to Ising models and directed percolation. Phys Rev Lett 53:311
Author information
Authors and Affiliations
Corresponding author
Additional information
This work was presented in part at the 13th International Symposium on Artificial Life and Robotics, Oita, Japan, January 31–February 2, 2008
About this article
Cite this article
Ichise, Y., Ishida, Y. Reverse engineering of spatial patterns in cellular automata. Artif Life Robotics 13, 172–175 (2008). https://doi.org/10.1007/s10015-008-0541-5
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10015-008-0541-5