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. SUMMARY C ellular automata (CA) are discrete complex systems which possess both a dynamic and a computational nature. In either case, based only upon their definition, it is not possible to forecast either their dynamic behavior, or the computation they will perform when running. However, it is possible to derive static parameters from their definition, which can then be used to estimate their dynamic behavior. This has already been done in the literature, but here we significantly extend previous efforts, by means of an analysis of the available parameters and the definition of new ones, which is achieved through the identification of a set of guidelines those parameters should abide by. The effectiveness of these guidelines are demonstrated, by using a set of five parameters drawn from them, as aids in the design of CA that should perform a predefined computational task; in the current case, such an aid represents guiding an evolutionary search for CA that perform a well-known task for one-dimensional CA, the so-called Synchronization Task.