Complexity · 2000 · 20 citations · 16 references
ComputingComputer ScienceMathematicsComplex SystemsDynamical SystemsForecastingAutomata TheoryCellular AutomataComplex Systems ModelingDynamic Systems ModelingEvolutionary ComputationFinite AutomataCellular Automata RulesEvolutionary SearchOne-dimensional Cellular AutomataRule Space AnalysisSynchronization
Abstract As paradigmatic complex systems, various studies have been done in the context of one‐dimensional cellular automata (CA) on the definition of parameters directly obtained from their transition rule, aiming at the help they might provide to forecasting CA dynamic behavior. Out of the analysis of the most important parameters available for this end, as well as others evaluated by us, a set of guidelines is proposed that should be followed when defining a parameter of that kind. Based upon the guidelines, a critique of those parameters is made, which leads to a set of five that jointly provide a good forecasting set; two of them were drawn from the literature and three are new ones defined according to the guidelines. By using them as a heuristic in the evolutionary search for CA of a predefined computational behavior, good results have been obtained, exemplified herein by the evolutionary search for CA that perform the Synchronization Task. © 2001 John Wiley & Sons, Inc.
16
Genetic algorithms in search, optimization, and machine learning
Choice Reviews Online · 1989 · 49.3K citations
Statistical mechanics of cellular automata
Stephen Wolfram · Reviews of Modern Physics · 1983 · 3.1K citations
Concrete Mathematics: A Foundation for Computer Science.
Edward A. Bender, Ronald Graham, Donald E. Knuth et al. · American Mathematical Monthly · 1991 · 1.4K citations