A new approach to study the evolution complexity of cellular automata is proposed and explained thoroughly by an example of elementary cellular automaton of rule 56. Using the tools of distinct excluded blocks, comput...A new approach to study the evolution complexity of cellular automata is proposed and explained thoroughly by an example of elementary cellular automaton of rule 56. Using the tools of distinct excluded blocks, computational search and symbolic dynamics, the mathematical structure underlying the time series generated from the elementary cellular automaton of rule 56 is analyzed and its complexity is determined, in which the Dyck language and Catalan numbers emerge naturally.展开更多
基金This work is supported by the Special Funds for Major State Basic Research Project.
文摘A new approach to study the evolution complexity of cellular automata is proposed and explained thoroughly by an example of elementary cellular automaton of rule 56. Using the tools of distinct excluded blocks, computational search and symbolic dynamics, the mathematical structure underlying the time series generated from the elementary cellular automaton of rule 56 is analyzed and its complexity is determined, in which the Dyck language and Catalan numbers emerge naturally.
