THE RELATIONSHIPS OF THREE ELEMENTARY CELLULAR AUTOMATA

作     者：Zhisong JIANG Zhisong JIANG Department of Mathematics,East China University of Science and Technology,Shanghai 200237,China.

作者机构：Department of Mathematics East China University of Science and Technology Shanghai 200237 China 

出 版 物：《Journal of Systems Science & Complexity》 (系统科学与复杂性学报（英文版）)

年 卷 期：2006年第19卷第1期

页      面：128-136页

核心收录：

学科分类：12[管理学] 1201[管理学-管理科学与工程(可授管理学、工学学位)] 081104[工学-模式识别与智能系统] 08[工学] 0835[工学-软件工程] 0811[工学-控制科学与工程] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

基　　金：This research is supported by the National Natural Science Foundation of China(10101016) 

主　　题：Cellular automata grammatical complexity limit language. 

摘      要：Limit language complexity of cellular automata which is first posed by S. Wolfram has become a new branch of cellular automata. In this paper, we obtain two interesting relationships between elementary cellular automata of rules 126, 146（182） and 18, and prove that if the limit language of rule. 18 is not regular, nor are the limit languages of rules 126 and 146（182）.