Classification of Cellular Automata Rules Based on Their Properties
Discrete Mathematics
2009-05-13 v1
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].
Keywords
Cite
@article{arxiv.0905.1769,
title = {Classification of Cellular Automata Rules Based on Their Properties},
author = {Pabitra Pal Choudhury and Sudhakar Sahoo and Sk Sarif Hasssan and Satrajit Basu and Dibyendu Ghosh and Debarun Kar and Abhishek Ghosh and Avijit Ghosh and Amal K. Ghosh},
journal= {arXiv preprint arXiv:0905.1769},
year = {2009}
}
Comments
Releted to Cellular Automata!