期刊文献+
共找到1篇文章
< 1 >
每页显示 20 50 100
COMPLEXITY OF EVOLUTION LANGUAGES OF THE ELEMENTARY CELLULAR AUTOMATON OF RULE 146 被引量:1
1
作者 Wang Yi morita kenichi 《Applied Mathematics(A Journal of Chinese Universities)》 SCIE CSCD 2006年第4期418-428,共11页
Symbolic dynamics of cellular automata is introduced by coarse-graining the temporal evolution orbits. Evolution languages are defined. By using the theory of formal languages and automata, the complexity of evolution... Symbolic dynamics of cellular automata is introduced by coarse-graining the temporal evolution orbits. Evolution languages are defined. By using the theory of formal languages and automata, the complexity of evolution languages of the elementary cellular automaton of rule 146 is studied and it is proved that its width 1-evolution language is regular, but for every n ≥ 2 its width n-evolution language is not context-free but context-sensitive. Also, the same results hold for the equivalent (under conjugation) elementary cellular automaton of rule 182. 展开更多
关键词 COMPLEXITY cellular automaton evolution language formal language.
下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部