Abstract
Das et al. have reported characterization of reachable/non-reachable CA states recently. Their scheme has only offered the characterization under a null boundary CA (NBCA). However, in hardware implementation, a periodic boundary CA (PBCA) is suitable for constructing cost-effective schemes such as a linear feedback shift register structure because of its circular property. Thus, this paper provides two decision algorithms for classification of reachable/non-reachable state and group/non-group CA based on periodic boundary condition. © Springer-Verlag Berlin Heidelberg 2006.
Cite
CITATION STYLE
Kang, B. H., Jeon, J. C., & Yoo, K. Y. (2006). Decision algorithms for cellular automata states based on periodic boundary condition. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4173 LNCS, pp. 104–111). Springer Verlag. https://doi.org/10.1007/11861201_15
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
