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). ...

In this paper we consider several notions of alternation in cellular automata: non-uniform, uniform and weak alternation. We study relations among these notions and with alternating Turing machines. It is proved that the ...

This paper exposes a procedure for modeling and solving linear systems using continuousvalued cellular automata. The original part of this work consists on showing how the cells in the automaton may contain both real values ...

In this thesis our main interest is focused specically on the dynamics of cellular automata. Dynamics will be addressed by the invariance of the automaton, and in some cases invariance will be addressed by its reversibility. ...

For the action of an algebraic cellular automaton on a Markov subgroup, we show that the Ces`aro mean of the iterates of a Markov measure converges to the Haar measure. This is proven by using the combinatorics of the ...

For the action of an algebraic cellular automaton on a Markov subgroup, we show that the Cesàro mean of the iterates of a Markov measure converges to the Haar measure. This is proven by using the combinatorics of the ...