Classification of Cellular Automata Rules Based on Their Properties

Simple item page
dc.creatorChoudhury, Pabitra Pal
dc.creatorSahoo, Sudhakar
dc.creatorHasssan, Sk Sarif
dc.creatorBasu, Satrajit
dc.creatorGhosh, Dibyendu
dc.creatorKar, Debarun
dc.creatorGhosh, Abhishek
dc.creatorGhosh, Avijit
dc.creatorGhosh, Amal K.
dc.date2009-05-12
dc.date.accessioned2026-07-07T13:14:02Z
dc.date.available2026-07-07T13:14:02Z
dc.descriptionThis 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].
dc.descriptionReleted to Cellular Automata!
dc.identifierhttps://arxiv.org/abs/0905.1769
dc.identifierhttp://arxiv.org/abs/0905.1769
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/230083
dc.subjectDiscrete Mathematics
dc.titleClassification of Cellular Automata Rules Based on Their Properties
dc.typetext

Files

Collections

arXiv