The idea behind dynamical systems theory is studying, understanding, and estimating the long place behavior of a system that changes in time. The characterization of this behavior consists in knowing which are the conditions of a system such that it has a particular comportment; some examples of these comportments are the following:
Using some useful topological concepts we define a dynamical systems in the following way: ds
A consequence of definition 3 is the concept of an orbit of a given point in the space : or
The reason for the compactness of the space is that such spaces can be covered and thereby represented by a finite number of sets. With this, the orbit of a point in the space can be described by the finite number of sets that it reaches, and this feature provides an easier analysis. In the study of the dynamical behavior in reversible one dimensional cellular automata, we are interested in characterizing the orbits of the configurations in the configuration space applying the global mapping . In particular, we want to describe the periodic, recurrent and the transitive behavior, for this motive, based on the works of J. de Vries [dV93] and Clark Robinson [Rob95] we present some definitions of these kinds of behavior. pp
In the previous definition, we are using the topologycal nature of the space utilizing the open sets of this space for characterizing the non-wandering orbits that mapping can generate. Until now, we have defined orbits with a recurrent behavior, but another question is if the dynamical behavior of the system is such that an orbit can reach each one of the neighborhoods that cover the space . This idea gives the following definition: tp
Definition 7 establishes a point that cross all the neghbborhoods in a finite covering of a dynamical system . Another transitive behaviors are also possible: te
This definition looking for the existence of a topologically transitive point in every open set of the space . Periodicity and transitivity of points and open sets are the dynamical behaviors that we shall analyse in reversible one dimensional cellular automata. In addition, we will define one more concept, if there exists an orbit such that it reaches a given open set and it remains there forever. tom
In section 5 we will develop some matrix methods for detecting the existence of the different points and sets described in the previous definitions in reversible one dimensional cellular automata.