论文信息 - Classification of Cellular Automata Rules Based on Their Properties

Classification of Cellular Automata Rules Based on Their Properties

This paper presents a classification of Cellular Automata rules based on its properties at the nth iteration. Elaborate computer program has been designed to get the nth iteration for arbitrary 1-D or 2-D CA rules. Studies indicate that the figures at some particular iteration might be helpful for some specific application. The hardware circuit implementation can be done using opto-electronic components [1-7].

[1] Y. Ichioka,et al. Optical parallel logic gates using a shadow-casting system for optical digital computing , 1984, Proceedings of the IEEE.

[2] Mithun Chakraborty,et al. Implementation of Basic Arithmetic Operations Using Cellular Automaton , 2008, 2008 International Conference on Information Technology.

[3] Subhasish Mitra,et al. VLSI architecture of a cellular automata machine , 1997 .

[4] Tommaso Toffoli,et al. Cellular Automata Machines , 1987, Complex Syst..

[5] Santanu Chattopadhyay,et al. Additive cellular automata : theory and applications , 1997 .

[6] Pabitra Pal Choudhury,et al. Chaotic Fractals with Multivalued Logic in Cellular Automata , 2007 .

[7] Pabitra Pal Choudhury,et al. Theory and Applications of Two-dimensional, Null-boundary, Nine-Neighborhood, Cellular Automata Linear rules , 2008, ArXiv.

[8] John von Neumann,et al. Theory Of Self Reproducing Automata , 1967 .

[9] Andrew Wuensche,et al. The global dynamics of cellular automata : an atlas of basin of attraction fields of one-dimensional cellular automata , 1992 .

[10] Yoshiki Ichioka,et al. Optical logic array processor using shadowgrams , 1983 .

[11] Amal K. Ghosh,et al. Trinary optical logic processors using shadow casting with polarized light , 1990 .

[12] Burton Voorhees,et al. Additive Cellular Automata , 2009, Encyclopedia of Complexity and Systems Science.