Evolutionary Algorithms for Group/Non-group Decision in Periodic Boundary CA

Abstract

Cellular automata (CA) have been used for modeling the behavior of complex systems such as the VLSI technology and parallel processing system. Recently, Das et al. have reported the characterization of reachable/non-reachable CA states. Their scheme has only offered characterization under a null boundary CA (NBCA). In the simplifications of hardware implementation, however, a periodic boundary CA (PBCA) is suitable for constructing cost-effective schemes such as a linear feedback shift register (LFSR) structure because of its circular properties. Thus, this paper presents two evolutionary algorithms for the identification of the reachable/non-reachable state and the group/non-group CA based on periodic boundary conditions.

This research was supported by the MIC (Ministry of Information and Communication), Korea, under the ITRC (Information Technology Research Center) support program supervised by the IITA (Institute of Information Technology Assessment). This work was also supported by the Brain Korea Project 21 in 2006.