Related papers: Relationship of Two Discrete Dynamical Models: One…
Cellular automata represent physical systems where both space and time are discrete, and the associated physical quantities assume a limited set of values. While previous research has applied cellular automata in modeling chemical,…
We present a simple one-dimensional Cellular Automaton (CA) which has the property that an initial state composed of two binary numbers evolves quickly into a final state which is their sum. We call this CA the Adding Cellular Automaton…
In this paper I present a first attempt for a possible description of fluids dynamics by mean of a cellular automata technique. With the use of simple and elementary rules, based on random behaviour either, the model permits to obtain the…
A detail study on the In-degree Distribution (ID) of Cellular Automata is obtained by exact enumeration. The results indicate large deviation from multiscaling and classification according to ID are discussed. We further augment the…
Periodicity and relaxation are investigated for the trajectories of the states in one-dimensional finite cellular automata with rule-90 and 150. The time evolutions are described with matrices. Eigenvalue analysis is applied to clarify the…
The probabilistic cellular automaton (PCA) method is highlighted for its relatively simple numerical algorithm and low computational cost in the simulation of microstructural evolution. In this method, probabilistic state change rules are…
Cellular Automata (CAs) are computational models that can capture the essential features of systems in which global behavior emerges from the collective effect of simple components, which interact locally. During the last decades, CAs have…
In this thesis we will work under the premises of the Cellular Automata Interpretation of QM, by Gerard 't Hooft, according to whom particles evolve following the rules of Cellular Automata (CA), a mathematical model consisting of discrete…
A method for studying the qualitative dynamical properties of abstract computing machines based on the approximation of their program-size complexity using a general lossless compression algorithm is presented. It is shown that the…
Using a group-theoretic approach, a method for determining the equivalence classes (also called orbits) of the set of rules of one-dimensional cellular automata induced by the symmetry operations of reflection and permutation and their…
In the fields of computation and neuroscience, much is still unknown about the underlying computations that enable key cognitive functions including learning, memory, abstraction and behavior. This paper proposes a mathematical and…
For a class of one-dimensional cellular automata, we review and complete the characterization of the invariant measures (in particular, all invariant phase separation measures), the rate of convergence to equilibrium, and the derivation of…
Dimensionality reduction techniques have found great success in a wide range of fields requiring analysis of high-dimensional datasets. Time-lagged independent components analysis (TICA), which finds independent components (TICs) with…
Cellular automata (CA) are dynamical systems defined by a finite local rule but they are studied for their global dynamics. They can exhibit a wide range of complex behaviours and a celebrated result is the existence of (intrinsically)…
Cellular automata are both computational and dynamical systems. We give a complete classification of the dynamic behaviour of elementary cellular automata (ECA) in terms of fundamental dynamic system notions such as sensitivity and…
The Biham-Middleton-Levine (BML) traffic model is a simple two-dimensional, discrete Cellular Automaton (CA) that has been used to study self-organization and phase transitions arising in traffic flows. From the computational point of view,…
The phase diagram of the coupled sine circle map lattice shows spatio-temporal intermittency of two distinct types: spatio-temporal intermittency of the directed percolation (DP) class, and spatial intermittency which does not belong to…
Tumor growth from a single transformed cancer cell up to a clinically apparent mass spans many spatial and temporal orders of magnitude. Implementation of cellular automata simulations of such tumor growth can be straightforward but…
Every transitive cellular automaton (CA) is sensitive to initial conditions. We study this implication in the more general context of non-uniform cellular automata (NUCA) with finitely many different local update rules assigned to cells. We…
Correlated time series are time series that, by virtue of the underlying process to which they refer, are expected to influence each other strongly. We introduce a novel approach to handle such time series, one that models their interaction…