선형 GF(2p) 셀룰라 오토마타의 분석과 합성

Abstract

Cellular Automata(CA) has been used as modeling and computing paradigm for a long time and it has been used to model many physical systems. While studying the models of systems, it is seen that as the complexity of the physical system increase, the CA based model is very complex and difficult to track analytically. Also such models fail to recognize the presence of inherent hierarchical nature of a physical system. So the study the linear GF(2^p) multiple attractor cellular automata is needed. In this paper we analyze the linear GF(2^p) multiple attractor cellular automata, synthesize the linear GF(2^p) multiple attractor cellular automata and give the characterization of linear GF(2^p) multiple attractor cellular automata.