We introduce the notion of pre expansivity for cellular automata (CA): it is the property of being positively expansive on asymptotic pairs of configurations (i.e. configurations that differ in only finitely many positions). ...

We consider the typical asymptotic behaviour of cellular automata of higher dimension (>= 2). That is, we take an initial configuration at random according to a Bernoulli (i.i.d) probability measure, iterate some cellular ...

The problem of knowing and characterizing the transitive behavior of a given cellular automaton is a very interesting topic. This paper provides a matrix representation of the global dynamics in reversible one-dimensional ...

The Prisoner's Dilemma (PD) is one of the most popular games of the Game Theory due to the emergence of cooperation among competitive rational players. In this paper, we present the PD played in cells of one-dimension ...

In this paper an association between Petri nets (PN) and cellular automata (CA) is proposed to analyze the global dynamics of flexible manufacturing systems (FMS). This relation is carried out taking into account the ...

Automata Networks are discrete dynamical systems initially introduced by von Neumann [84], Mc-Culloch [50] and Ulam [81] and they have been used to model diverse complex systems such as the study of the evolution and ...

Reversible cellular automata are discrete dynamical systems based on local interactions which are able to produce an invertible global behavior. Reversible automata have been carefully analyzed by means of graph and matrix ...