Abstract
This paper presents a GA-based synthesis algorithm of a cellular automaton ( CA ) that can generate a desired spatio-temporal pattern. Time evolution of CA is determined by a rule table the number of which is enormous even for relatively small size CAs: the brute-force search is almost impossible. In our GA-based synthesis algorithm, a gene corresponds to a rule and a masking technique is used to preserve gene(s) with good fitness. Performing basic numerical experiments we have confirmed that the masking works effectively and the algorithm can generate a desired rule table. We have also considered an application to reduction of noise inserted randomly to a spatio-temporal pattern.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Wolfram, S.: Universality and Complexity in Cellular Automata. Physica D 10, 1–35 (1984)
Chua, L.O., Yoon, S., Dogaru, R.: A nonlinear dynamics perspective of Wolfram’s new kind of science. Part I: Threshold of complexity. Int. J. Bifurcation and Chaos 12, 2655–2766 (2002)
Perrier, J.Y., Sipper, M., Zahnd, J.: Toward a viable, self-reproducing universal computer. Physica D 87, 335–352 (1996)
Lohn, J.D., Reggia, J.A.: Automatic discovery of self-replicating structures in cellular automata. IEEE Trans. Evolutionary Computation 1(3), 165–178 (1997)
Bull, L., Lawson, I., Adamatzky, A., De LacyCostello, B.: Towards predicting spatial complexity: a learning classifier system approach to cellular automata identification. In: Proc. of CEC, pp. 136–141 (2005)
Seredynski, M., Bouvry, P.: Block Cipher based on Reversible Cellular Automa. In: Proc. of CEC, pp. 2138–2143 (2004)
Wada, M., Kuroiwa, J., Nara, S.: Completely reproducible description of digital sound data with cellular automata. Phys. Lett. A 306, 110–1158 (2002)
Wada, M., Kuroiwa, J., Nara, S.: Errorless reproduction of given pattern dynamics by means of cellular automata. Phys. Rev. E 68 036707, 1–8 (2003)
Kajisha, H., Saito, T.: Synthesis of self-replication cellular automata using genetic algorithms. In: Proc. of IJCNN, V, pp. 173–177 (2000)
Yamamichi, T., Saito, T., Taguchi, K., Torikai, H.: Synthesis of binary cellular automata based on binary neural networks. In: Proc. of IJCNN, pp. 1361–1364 (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Suzuki, S., Saito, T. (2006). Synthesis of Desired Binary Cellular Automata Through the Genetic Algorithm. In: King, I., Wang, J., Chan, LW., Wang, D. (eds) Neural Information Processing. ICONIP 2006. Lecture Notes in Computer Science, vol 4234. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11893295_81
Download citation
DOI: https://doi.org/10.1007/11893295_81
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-46484-6
Online ISBN: 978-3-540-46485-3
eBook Packages: Computer ScienceComputer Science (R0)