检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]School of Mathematics and Statistics, Wuhan University
出 处:《Acta Mathematica Scientia》2016年第2期579-592,共14页数学物理学报(B辑英文版)
基 金:supported by the Fundamental Research Funds for the Central Universities(2012201020204);the second author is supported by NSFC(11171128,11271148)
摘 要:We investigate topological entropy of periodic Coven cellular automatas; that is, the maps Fs: (0, 1)^z → {0, 1)^z defined by FB(x)i=xi+^rПj=1(xi+j+bj)(mod 2), where B = b1b2…br ∈ {0, 1}^r(r≥2), is a periodic word. In particular, we prove that if the minimal period of B is greater than 5, the topological entropy is log 2.We investigate topological entropy of periodic Coven cellular automatas; that is, the maps Fs: (0, 1)^z → {0, 1)^z defined by FB(x)i=xi+^rПj=1(xi+j+bj)(mod 2), where B = b1b2…br ∈ {0, 1}^r(r≥2), is a periodic word. In particular, we prove that if the minimal period of B is greater than 5, the topological entropy is log 2.
关 键 词:Cellular automata periodic word topological entropy
分 类 号:TP301.1[自动化与计算机技术—计算机系统结构]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.15