首页 | 本学科首页   官方微博 | 高级检索  
     检索      

22号初等元胞自动机的演化复杂性
引用本文:王益,江志松.22号初等元胞自动机的演化复杂性[J].高校应用数学学报(英文版),2002,17(4):404-412.
作者姓名:王益  江志松
作者单位:[1]Dept.ofMath.,SuzhouUniv.,Suzhou215006,China [2]PhysicalSchool,EastChinaUniv.ofSci.andTech.,Shanghai200237,China
基金项目:National Natural Science Foundation of China (1 0 1 0 1 0 1 6),Tian Yuan Founda- tion(1 0 1 2 60 2 0 )
摘    要:Cellular automata are the discrete dynamical systems of simple construction but with complex and varied behaviors. In this paper, the elementary cellular automaton of rule 22 is studied by the tools of formal language theory and symbolic dynamics. Its temporal evolution orbits are coarse-grained into evolution sequences and the evolution languages are defined. It is proved that for every n≥2 its width n evolution language is not regular.

关 键 词:22号初等元胞自动机  演化  复杂性  形式语言  动力学
收稿时间:18 April 2002

Evolution complexity of the elementary cellular automaton of rule 22
Yi Wang,Zhisong Jiang.Evolution complexity of the elementary cellular automaton of rule 22[J].Applied Mathematics A Journal of Chinese Universities,2002,17(4):404-412.
Authors:Yi Wang  Zhisong Jiang
Institution:(1) Dept. of Math., Suzhou Univ., 215006 Suzhou, China;(2) Physical School, East China Univ. of Sci. and Tech., 200237 Shanghai, China
Abstract:Cellular automata are the discrete dynamical systems of simple construction but with complex and varied behaviors. In this paper, the elementary cellular automaton of rule 22 is studied by the tools of formal language theory and symbolic dynamics. Its temporal evolution orbits are coarse-grained into evolution sequences and the evolution languages are defined. It is proved that for every n≥2 its width n-evolution language is not regular. Supported by the National Natural Science Foundation of China (10101016) and Tian Yuan Foundation (10126020).
Keywords:complexity  cellular automaton  formal language  
本文献已被 CNKI 维普 万方数据 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号