Classification of Cellular Automata Rules Based on Their Properties
Pabitra Pal ChoudhurySudhakar SahooHasssan, Sk SarifSatrajit BasuDibyendu GhoshDebarun KarAbhishek GhoshAvijit GhoshAmal K. Ghosh
2009en
ABI
Annotatsiya
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].
Hali tarjima qilinmagan
Identifikatorlar
Iqtiboslar va manbalar
4 ta iqtibos0 ta foydalanilgan manba