Related papers: Non-deterministic density classification with diff…
Cellular automata (CA) have been found as an attractive modeling tool for various applications, such as, pattern recognition, image processing, data compression, encryption, and specially for VLSI design & test. For such applications,…
In this paper we present two interesting properties of stochastic cellular automata that can be helpful in analyzing the dynamical behavior of such automata. The first property allows for calculating cell-wise probability distributions over…
We develop a two-dimensional cellular automaton (CA) as a simple model for agents moving from origins to destinations. Each agent moves towards an empty neighbor site corresponding to the minimal distance to its destination. The…
We show that a wide variety of non-linear cellular automata (CAs) can be decomposed into a quasidirect product of linear ones. These CAs can be predicted by parallel circuits of depth O(log^2 t) using gates with binary inputs, or O(log t)…
In this article, we have proposed an epidemic model by using probability cellular automata theory. The essential mathematical features are analyzed with the help of stability theory. We have given an alternative modelling approach for the…
This article presents a new characterization of controllability and regional controllability of Deterministic Cellular Automata (CA for short). It focuses on analyzing these problems within the framework of control theory, which have been…
A new stochastic cellular automaton (CA) model of traffic flow, which includes slow-to-start effects and a driver's perspective, is proposed by extending the Burgers CA and the Nagel-Schreckenberg CA model. The flow-density relation of this…
Cyclic cellular automata (CCA) are models of excitable media. Started from random initial conditions, they produce several different kinds of spatial structure, depending on their control parameters. We introduce new tools from information…
Cellular Automata (CA) are discrete dynamical systems and an abstract model of parallel computation. The limit set of a cellular automaton is its maximal topological attractor. A well know result, due to Kari, says that all nontrivial…
The theory of cellular automata in operational probabilistic theories is developed. We start introducing the composition of infinitely many elementary systems, and then use this notion to define update rules for such infinite composite…
A Cellular Automata (CA) is a computing model of complex System using simple rule. In CA the problem space into number of cell and each cell can be one or several final state. Cells are affected by neighbours' to the simple rule. Cellular…
We present analytical results for first-passage processes in a deterministic one-dimensional cellular automaton (CA) model of traffic flow. Starting at time $t=0$ from a random initial state with car density p, at every time step $t\ge 1$…
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…
An introduction to cellular automata (both deterministic and probabilistic) with examples. Definition of deterministic automata, dynamical properties, damage spreading and Lyapunov exponents; probabilistic automata and Markov processes,…
Cellular Automata are discrete dynamical systems that evolve following simple and local rules. Despite of its local simplicity, knowledge discovery in CA is a NP problem. This is the main motivation for using data mining techniques for CA…
We discuss various properties of Probabilistic Cellular Automata, such as the structure of the set of stationary measures and multiplicity of stationary measures (or phase transition) for reversible models.
We exhibit a Probabilistic Cellular Automaton (PCA) on the integers with an alphabet and a neighborhood of size 2 which is non-ergodic although it has a unique invariant measure. This answers by the negative an old open question on whether…
Dynamic properties of a one-dimensional probabilistic cellular automaton are studied by monte-carlo simulation near a critical point which marks a second-order phase transition from a active state to a effectively unique absorbing state.…
Some deterministic cellular automata have been observed to follow the pattern of the second law of thermodynamics: starting from a partially disordered state, the system evolves towards a state of equilibrium characterized by maximal…
Cellular Automata (CA) are common and most simple models of parallel computations. Edge detection is one of the crucial task in image processing, especially in processing biological and medical images. CA can be successfully applied in…