pith. sign in

arxiv: 0905.1769 · v1 · submitted 2009-05-12 · 💻 cs.DM

Classification of Cellular Automata Rules Based on Their Properties

classification 💻 cs.DM
keywords iterationrulesautomatacellularclassificationpropertiessomeapplication
0
0 comments X
read the original 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].

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.