摘要
针对初等细胞自动机的特点,使用分块矩阵(称之为局部规则矩阵)对初等细胞自动机的局部规则进行了基于矩阵形式的定义.在此基础上,定义了识别函数及其运算法则,并利用这些定义和法则给出了初等细胞自动机局部规则的通用算法.对于初等细胞自动机,这些研究的成果意味着在t时刻任何一个细胞及其邻居的状态的组合,都可以利用识别函数及其运算法则的函数运算得到t+1时刻的演化结果.
According to the characteristics of elementary cellular automata, partitioned matrix （called local rule matrix） is employed to define the local rules in the form of the matrix for the elementary cellular automata. On the basis of all above, the paper also defines the recognition function and its algorithm, and then gives the general algorithm of the local rules in the elementary cellular automata with these definitions and rules. For the elementary cellular automata, these researching results imply that we can get the involving result at the moment t＋1 from any state combination of a cell and its neighbor at the moment t by the computation of the recognition function and its algorithm.
出处
《测试技术学报》
2008年第5期423-426,共4页
Journal of Test and Measurement Technology
关键词
初等细胞自动机
局部规则
通用算法
elementary cellular automata
local rule
general algorithm
