摘要
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）.
基金
This research is supported by the National Natural Science Foundation of China(10101016).
