摘要
用形式语言理论和符号动力学对126号初等元胞自动机的演化复杂性进行研究.证得其1-演化语言为正规的,而n≥2时其n-演化语言为非正规的.
In this paper we study the grammatical complexity of evolution languages generated from Elementary Cellular Automata of Rule 126 by the tools of formal language theory and symbolic dynamics.It is proved that its width 1-evolution language is regular but for every n≥2 its width n-evolution language is not reguar.
出处
《苏州大学学报（自然科学版）》
CAS
2008年第2期37-41,共5页
Journal of Soochow University(Natural Science Edition)
基金
国家自然科学基金资助项目(10101026)
