Classification of Cellular Automata Rules Based on Their Properties

Abstract

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].

Identifiers

DOI

10.48550/arxiv.0905.1769

Citations and references